0% found this document useful (0 votes)
13 views

AI-Unit-3

The document discusses various search algorithms used in problem-solving, including well-defined problems, search space formulation, and performance evaluation of different search techniques. It covers methods such as Breadth-First Search (BFS), Depth-First Search (DFS), Uniform Cost Search (UCS), and A* Search, highlighting their completeness, optimality, and complexity. Additionally, it emphasizes the importance of evaluating the efficiency and effectiveness of these algorithms in finding solutions.

Uploaded by

rabinbruhh777
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
13 views

AI-Unit-3

The document discusses various search algorithms used in problem-solving, including well-defined problems, search space formulation, and performance evaluation of different search techniques. It covers methods such as Breadth-First Search (BFS), Depth-First Search (DFS), Uniform Cost Search (UCS), and A* Search, highlighting their completeness, optimality, and complexity. Additionally, it emphasizes the importance of evaluating the efficiency and effectiveness of these algorithms in finding solutions.

Uploaded by

rabinbruhh777
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 21
UNIT-3 Problem. i earchi Proler, aalving wn AT we a systematic. search Heeughe a rye, of possible. chin Sn oder Lewd cee, predesi ata aa is ple ane as follews: et Bae agel hoc Fedelere fovimulecions ais a ee ea deciding vad aclios ard slabs +o MM) Search Mh ry ee Oryrtines, pesstble, Sequence of achions and choose Phe besl ome, ee sla Ue abies 4, — Seandhing— Th 48 @ commonly used method the -seanth Fedwique. ye the poalide Coes ‘ein “am make ma Space. of ‘shates’, called the search Space, ie Froblern Forrmuladion-+ EE solves deciding had acbtens and adades dy conetler, wegpeen ing A problem an be lefinel forall by 4 components } An antl auf which 1 ate Deseri phon: Pct el 2 ppapbl ack aril mn age th Geal teat, dest: unite ny pea fan dade ox ved, > Pad cost: Pal costs Sun of coed cf each path fom initial A gen slate. Btode S ni Res rhe cdabe space 9% ee necked graph with each node, $8 a stabe ard anc represents the splat En openaher crarformig a. ade de a slceaser hae, A fom the faful sdabe to grat state costing of (5.5,0,6) ene, aaa de poration { 5 tp transfor stale fo He cuc Rare fn ab MGR). Scanned with CamScanner Bacunple;. & A“ ai © a S= TAIBSC DEF, 644,774 s=A Giz fP,33 Well Defined Problem: A prin thal Lacks ot or mne of the boelino 5 prop 48 an ‘all—defined lem Bul a well- dered! Prclem con be ef Soma by flo ve como Puch abales atate fawn whith agent start Potable Description (Successor sha > ean of posstble Pisleke Spey aL LIAL’ AE veackebh fon ned S: rytai Jnl: Sie tea Space. fath 4 Kr. wen mp fal ost >Swn of cost of ech path from. anthal » v Creal. decd > Dehonrninig Aw stoke 46 pool abede Well. defined. prodlern: geen chde, T vot, Vacuum wold fade problem, Real world Reoblom (Used to defne the es time. ah and Sruyman reaounce. cos), To (Used to « protien ope... erfomance d of oyete) P Scanned with CamScanner @sabing Palalens zanna, Co Mana , cpt std ed plied ed al ck eer. etHtes, The. number associated to a ink represents the Mee covrtsnondin Bh SO fan mas Bt le deel poem. 4s + find 2h ®=—-© *~O, © 7 ©* Bigs A graph. representation. of : es pl be bed bp jus broke Sarak, methods, ‘applicabionss oan he eo ruanbe. focal send wnld ‘There ane foo bad seagl- se: ah adegies: earch. S-> Inthe wathod the order wigs Sra atc idree Lhe alee, aii Depth ‘ida meh aber hee oe Heuntebs a immed Search ractheds > Th this yaebhod . % uses clomate dependent (leuntstte) Selon a7 orden sean. the yore. ri » By Greedy besf (sf ‘earch, A seach, jl ee te be! @ Rerdormance, Paluation of Search. Techniques i — aint the performaree of searchsechrigueg m Plomplelencss-> An alaertthn d dohe complede. #4 44 Fa sala sb de publ fox,” THOR Scanned with CamScanner cast) bes 2h tale WThme. Cengletly-> Woo (worst or Buerage to find a Bhlubion ? Usually measured sri derms of number af nodes, expanded. ms 2 thy —» How vnuch space 4s used. lay the abjorithn ? sually measured. ee of the vnascimum. Puumber. redex me. m ‘meme ata “ Ooeath Adrntestbrhely> Ff a solubion 14 urd, #15 4f aw eto be an optional one? For example, ts t¢ the me with ywinimum cdot 2 Time and Space. complexity ane meagured m tous ef! obo ia aly pele Padtba, of successor fey node) thes sere a 4 of the teast-cost solibtn, Dd > Maximun Aength of avy path in Le, pace. Example: 2 @ao 257 yall Be _AVatferned Seardhs, @® Creadth Firsh Search (BFS)! Tt 38 an for Araversing a data. shue i hae with Bro dec dk iad the wipes wes oe L deplh cr 4 ap Faro isla A! He nerd depth devel, 4 wrod ono the Graph @ chavensed 5a fll, Set Ts ser and veil fh ms of cured las, a Brett cM rode of fe male abeady panor da Bu0td ort. Joop, be avoid Loop an, eee 4s 1 EF, ek. ey sseticer with CamScanner fin Te 2b a ele Tre plexthy—> Assume & stale, ‘Space where. every dale tag b successars then Ot)=bsb+ P+. +b = OCW), Se eee ae ae Sot dae ten he lad de) ane on Oe. So 3 le: ft. ot 5, avenstng pace. comple Opdimal-> Ff all the paths shes same. cosh Bhan. opined thease nef. Majer lessons from. BFS anes Memory management a§ the |p Assuc. than ths execubjen Lime ee complenity con not Ne conju m seit eau App. learions ; > Soctal ne Weberles use. BFS, PIM GPS mar ns > fradeselng mie es OADepth. rsh Search (OSs th $5 another wethed for de = Shree. er graph dada. sided es abeith clad at yet vode Ynd e a5 jor. 28 posstble along each branch hefme backdea ching, 38 Amplemented! mm KPO anchilechne (ata k). The ra shag y exploe ade che graph whiner ese ton G2 ot ne fe ance Meas Ss Es Needs olke fleet Stl ele aa dupth and on Guile ovr explored, the search hacksercks und gh reath, pled vile in ens wh vie re mes unttl all tho verttees ane reached Example; #Trovnsal f DRE 6 1)9j4)3,6) 5,2 23 sham a BWrAWS tre —_ Scanned with CamScanner f Rrformance, Measune /Fialiation of DPS:, Completeness» Tt does nat find the soliton mall cases (if le SS tnfiatte and DPS contains Lyps). Te lexts lol vas . Nenyicly Flee Ht rr ety hon ne bab+b+,,, +h" =0 (8. Space Complexhy-> Nee fo sere neole £0, = (btb+b4, xm Ame. = O(bm), eae ae Tart solubion. than. GS bred th does nofl et 2 or 3 of groph niepirndt' ernest ne Peete Delecdi le in ; Shi oe ~? Tope. teal os > Solu puzzle wih om © Uniform. Cosh Search (UCS):- Td 38 the. modified versten of BFS to male ophmal, This algaritrn 48 used for Lrovong or sung a welahfed. 7 raph, in begins at the vet snodes the search cordmnues bp vit ‘See wde, whch has the dash Jobal, cast fom Hel) rorf, It choos nof cane absuh the number of steps, oy cone abouk tue opal Example : ® 1, Such a8 mazes. Cesk, Scanned with CamScanner Performance measuae. of UC6: y abtetieg hs » becauge cosh 4 Peon, se BU at fal do Maximum of BPS, Tine Conpleethy> Maximum af BFS. pecarng rites at eveyy lip Me. publ wth dhe east coat 18 chosen. Gonclustn = UCS can le used tnsfead. of BPS -n case, Leb path cost 48 not equal and 13 quaranted to be greater th small. poche! value e a On oor @ Depth brwaled Bearch (DIS) Th 14 the yodtfiertion th-firsd search, TA 48 ar be So exploye. the a Tt woke exachly ~firsk search bub avotAs the. drawhacks anding completeness ley rmpesing a, maximum lomth on Ahe a of the. seanch. TL solves the stfitlepath problon of 5, * depth male mace depth 4o seanth tos ¢ a avid a 5 = nthe stage 48 get lege Hon vebure calubion ~ while vol emp! do take veda las 4 setts £ “et ri. view does = apaby operattons to nde Add men cit grea als shee am raew odes a reboe soluden; ferformane weacine of DIS 1 Cownel In init L 0) (31) Ss plexthi—> OCs) Opcmalthy »74 DS 48 complete, then HH optinal tan ors, Scanned with CamScanner @ Teretive Sats Gtvah_ Search: . This te hntyue 48 the combtnadtn of BRS and DPS so thal the completeness and opsimall BPS end the mem Yequivernent lebel of OFS could The ms les g zn Hits ae priced ane, as pers) mre » Ancreasi eal jon. ire vasa Se of he salve aud leh eaa sikovation, this yntthod visits the nodes m the search. free an fhe, orden, fired se: ; ohne sae ee ic -anch bu the cumuladtie order mn Example 5 tel 0 ARCDERGLH JAQCDERHHITK Serformarce Messin. f 2851 eleness-> TOFS 43 Ile BFS, TH in complele whn te branch) seg eM oe machi Space Complenthy > 0 (iH) Trrne_Complexthy—> (1), Oplnaly sre 4 abaifie BPS,S0 optimal whoo the aheps.), ape. Same costs DBidrectional Sear. Gr ‘Seanch ests te un Aw mull, search ai rt for tha ied ale lhe lh om dhe he tillmnch Shits cok Sra Git and AIM ec . eax rniddle. TE 30, dhe path concadenation oie ie pee Scanned with CamScanner _ Beagle: Total a - ak: ao Fenformance measure of Brdveclional search: Compldeness > Yes tt 48 complete sshen we ge BES m habh searches, Teme. Complexthy » 0 (1). Fpace Compleserly » 0 (bs) Cpdtrely > Optimal when BFS 4 uiedand paths me cfa untfom Ce atom. of All Unt. Searches: Stredeny | Complete [Oval Pine Conplenthy | Space. Compe BFS Yes ot) 1 OMA) DPS No * . Ow O(bwi) oS Yes (if Lyd) No ote) O (los) rors Yes Nea Ow) 0 (ta) gas Yes Nes Ob») O() BPS ard 8DS ane complele, and apna Int cesnes rave L Bs ds a se a a masivun. tree. cepts i eater tin rorement one oFs. | > Best thm. 2 IDPS ay wae 6 comple phnal | = Jarre rmsumpten bl A zations git. sabi | @ Heunteft a Ala); Packer re salt des She ‘ Ts os = 8 an eattmate based oom opete geal Ne CG. cneeee eas fil aaa, Scanned with CamScanner Ds Titomec. ox Heusashtc Geanchs Fired Seandh 5- Berd Ee ae we use evaluation. Sunchion $n) trot Aekensanes whide node 48 42 werk, Prat years rode with owest $n) 3a, expanded. feck! the. majer eonce of tnfermation fer fer) 4 Ail). thts chabegy ote, eahtmales of the cosh reaching dhe tool and 4 to matntmatse. 44. It constat ef hun Ayes basid on the evaluation functor wrth special cases which are ag fllesbi— Gre. Beat—Firsk Seancht wmode. aS x eld yon mipneten dealin phe wshich, 7 vext, Le Yue ee — for expansion eons 9h has Pre. closest Fvaluabion funchton (0) 6) = eomeahimale cach from n, goal. he a hos, OC) ape anil ne fe Dhos. 48, ranch ‘ rnasinurn depth ofl dhe cosne yf “oe Exareple+ a _ cS ® 5 (S_ 10 heb be geal viode., then ctehances 4o node G fam. other node BAG a2 7 U, = Bo 4 Caren lus) F2G=% DG =5 C3 =3 sadions grey seach operation #8 done. 2 bob. Hid=+ Hin)25 fon 85) Hin) 29 ene Scanned with CamScanner . Sakep Ae Seed. siete Now dhe. Lud 48 of node. Gr, bub Now Pee ton. $8 of vi rcuhe| oh em pale ie we ehap shore ferformance. Neasunes t Me Comsbdeness-> Th 13 vob 2 because. rehtle vrtntrat vale of chowselte gay ort eke tour ale 0 Teme. complexity» OC). Space complexity» OC BY). Opbrrnalthy-» Tt 48 nat optimal. DA* Search: Admtscthle. Heuntshto—> A seal fertien 8 aa in be ae Ra 0 om wk “peak ta took of preci “tel peak volede Onn “fn an Poor orttnn. eatin be, athe She achat cock of adn the goal ek Ss be dnvere than A* search uses hemtsdie furction. hin) as well as Hhe pet cot Jo the node, gy the tebal cont . firs Sng)” compl “a #00) = the evaluadron: function hin) > estimated, cosh fom ewnend wode 4p geet: stl ate cost from the shart rode to. cummed _ ‘This method See te. dowest Lennon path ig pe se on re pat Sgreds bie eee has igh cost than anoler. oy eb HS, neh higher. cos) palrvand Jraverss, lemon cost path. seg preess continues ule goal 48 reached, Scanned with CamScanner heb G by hele ae Mee geal nodes then clésdanees obo necle Gr fon ober Sr@=12 Boa et RaQ -F DIG =6 C3G+5 Solutions Skea @Qfy.10. a ce $(B=H9t4 215 $ (2846 244 $3 @) Cy Fi)=1¢ Shep-O: now dhe how 18 df note B, fe) =1t +7 29 F(c) > 1643 =19. $Oyene — Flrv=49 p25: Nes we fun a of node D ftny=12 F(G@)=18+0-48 Flyee fod (ey 1b+SH 46 Scanned with CamScanner Skee shee Liye (6) ‘i $(G)=49+0 219 $c) = 2044 =2- Sede 5 9, Qaur cr fs on hence we are. dont , By une8)- Gontiier ua seach abrongs gre us eetalen Time, Complexity O(b4). “lh cenevadal voles 7 Ss plexipy —> Tt 5 en 1. yngrne lence fa bee. 3h the = rather vot Lime . or Optimal: gfe opbimal solution, pail) A® 18 eedmtatble and considers fawer. nodes than other adntsathle seanch. abposth me with the same. -heuntsdte. “a (RW Ase Seancht- 15 search technug ue. canbe usedto solve problems Shot solubtens ushtce bed, ase clon “aaa Lh a van mens a ths: s. 14 Ar the solution, each bn me. Imp fl how the abpaibhin. bate realy a ements er ne, 2b hommes eae Evaluate dhe yi dale, hb P Siaaiecdtohaad pig 43 ad eal, state then terminate, re for thts shade an feroale a vee abate, ag ab BESS RE oleh dota wie iy pet alae B is eel clade etrun tervrtnade Otowotie Hel) lt clacig 4 4 mates Se = ve sos of the jake. lat ie es of self Scanned with CamScanner Stmulabed, Annealing Seanchs © ~~ creed el clk Phe main. difference 28 thad simulated annealin ‘n + also dt fo la f i er aS mea ad o cc easy ae cho sitl i Tf cael 48 betdr toed then at will be ace eet pili ae prtaui of accepting = ee Scanned with CamScanner a 28 an ampordant clam af AT. Games donde require, smnuch, lea 3 The broaledge we need. do provide 8 the vules, esad roves and the condsdime of hort lag the game. Both pa nS dy to wm the. pare. So b of thank yy to omake fhe Aral nove. posstale, ad a son. Seanchisg techni dike. oh accurate. is as the irene fa ves “hgh, ES sent will falee a lol of chime. Soy he. need mvother search procedunes at Improves ne chime. Games ane a form of vullt-agent envionment and ante. questions ike whal do other ¢ do and, shave thoy affect oun. Success? Compete vnullt-agend environments ge ® Adversartal Se wiiquegs sel Adversanal ce 9 aloo ban Mintmax search m cally dhe ne pend Heo lage ae He snfermation” 48 auatlable ,curf, 23 chess" 5, ¢ Hac doe, Th cmeistaf navy tite ee Aree heh capes ee possthle. moves ™ 5 a eS an ind ime of he lags, "F on fours of oss Gaame.—advers Wee to Gut. —rSelubim, 4a obs (5 spect . manve. for a. poser, opp repli). rime inthe force an. ode road. Bvaluakion funcktons evaluate Mgondneas? of gone postin, > Excampless chess , checkers, bachgammon, 4> The Minima: Search: _—_———— heb us asston the follnoi value. for the 31 for wm by x, re bys rch ie Coven ha ag of the douninal nodes (whe for x (a5 tos. “2), dr ino ; dhe tiecdorect es tse cat Oe eer he value she pale whe oh the bo of a ee valueg of bs Successors mraatnize ths eubeome), “rhe value of a “node where th 8 dhe dune of player O te move. 15 rk ime Oe ales of the, successors, ( because O titez Lo Scanned with CamScanner Rxamsles Constder dhe fallostyg goune tree (drain from the pot nf vie ef the maarstratotag we: x z ha-Reler Runt 2 hia eed applied to a bandas mamas dree, 4 velwms te Sane, wove. a& ybnmax. ae that canal possi srfluen we oa 8 lo irs can peste ap et ed. eae dlecteionn. anol 3¢ 43 6 Pegi ponune ‘erdvecub-heec rll ek a technique ue for ey, ee an parameters ‘albha. and f pectssony evaluation las agen 420 Below> £4 18 the value of He best (( found 20 far of aie preii ree ve have Scanned with CamScanner «Ro ed 4 he cwned board thule fr alpha cate > eb us, cotton tab she cum : te, node. A tm the fellooir, ; 1 cede thu node gaye Alegz15 ®) fig Tilusteodion fie ole cut-off! The wint—mase method uses a depth fired search chalyg heater th wil estimate the ema B firsh. Leb rode dee 8 be emlucled 15,3 Max will mae 4 @ Her 4 44 pumanlon by athinrs 26.thoefge 36 Jy elves Land Yo AG sohiomed mac pl Theefoe. value of oc ab mde B ie 15 heh 48 ransmtt fed upward te wde A ard, will be used, fr the othe. possible moves frm. A, val ol fo, eviluade the C, the Loft D -has b siete fle sepia oly ise. an % tees than wi oc, the bes. Yo i rie tale Bs a ees de. Tf the value of £25 Phan 40,Min will rere oD vshih dros dhe value tf mane cay nove fo EF usheh tos a vue ae San ip) tea oval doc, the bash shear geh 48 105 whi eas than the value 215 . tha we gob Af Mar would rave to 8. There the beat wove. for Max 48 fo 8 of the value of Bs The Elimination. of node. E #g ay alpha cuboff A beda, cubed +4 yepresents an upper bowrd for He ; “fF ered Ae tbe le a tha. Mew player Oe ay tn Mon pager de dad Scanned with CamScanner heb us assume hab he value of F og be evnluakl 40 45.thoelog . the value of fat dhe vedo P48 15. his value. 16 Loransmtbled, ped de ede B and will be used fer evalualyy He. often prt To evaluate Lhe vohe Gy ahs Left nosh hebus assume that the. hal aluabed frst. value, @ 16-26. Thon Seek the value of B, the beel mave. fer Mn 15 tp nade P, andependont ef walue of role I that need mot be. evaluated. a TH He value of 5 4g or equal 4o 25,-then. Max{inG) ae cee Phas. with move. ws an bobh cases Jon Bh eae Ose My | . Therefoe the best vnove for tin % ab 5 the value. «f=. The elsminabere of Ho node T #8 a bese cael @ Consdramt Sobtefacding Bobbys; (With. Raamples) A Constraint Sattefactin feblem (csp) consteds of a set of vantahles,a, cme values for each yanable and a » The obec; ts bo asei a value for each variable such Yrab All conafatabe ge Fxamples: the n-Queen problem feral es ek. A Gretraink Sattefelion Reblon ae chenacbertoed by: eee vantables P24 522,.,,,022, > e variable x4 & domain, Ds with Lb for that variable, and a cel 1 polit the poset vales ‘assured. do chad behceon te ere Hed are A €motramt Sale chin. " a vale m D3 fated Bode afer each $ from 1 om, Con: she sie are. catefed, first orden ‘fe ae onc stated. 23 @ sentence, -m (eotst 1)...(exal a0) (01 (09 4...InGan) => (Cr) A Censtratnt Sabtefchion problem 4 usually represenled undtrected. graph called. Consdeand a whore the rode ste vanlables and the calpes ane. the bmn constrateds, Scanned with CamScanner Brampless (Smpordaxt S State 1 game dre. (enavon. from the pent of view . Masti player’ Y@ % © | in What yneve. PE ary be pie Shaul) be the responce of Ye me te nie vend that ole the inf mac pees 2 a 9 tas Maze will move fo Ip Bet rete wil vespond by m ong te, Contre, the “fe ang eee en RE Ta ge ce draw draw wn Whot move showd be ch, cae Bs pp Map ll hl Ebsioost jemnane procecline,? Ja. ‘in wm Jose wm dose. loge clr dows tot dra dove were The move 98 shown by cthe anno Fre Scanned with CamScanner Brample Sy Constden She Lt Person. dram. pam: ef ‘tes op sea et ~~ font Mee a eae DO® 606 ® ic naw win lise dose vom loge dose. won wot oa $ Ose the alphabeba -auntng procedure. fo cledermine the wastes which should. be choesen F Ee of of the, ree, Which 9 val Sok SS acuehale eee v wh Max roveg to 0 4 onde fre so yrees fe H and Max. raveg tr S or R. wel no naundl rides 200-7; P avd OD doen sol A Conetder the “Aint ong 8 be Cn foe pe > Coretlen Be tage aetree yp Alpha. -bebe preniny priedne Mhck dy wan. hese OY 79 Be Scanned with CamScanner Os. LoUse the Phelps Procedure. evel thao whad nodes wasld athe rrirrer mage 98 the follacing trees Nery > Vis ote prio om sae rminar tmage of tre tree. ces ye: Ly g Savings @G@® 6 Re IO. eC. Ae ae Scanned with CamScanner

You might also like