Scribd
Upload
56 views67 pages

2 Unit

Good for btech students to study.

Uploaded by

satishnittana1
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
56 views67 pages

2 Unit

Good for btech students to study.

Uploaded by

satishnittana1
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/ 67
‘A -for acheotng goal by using left, Neh ONIT= 1 State Space search search Here the stale space pohere to bé placed fs Lup denn Operations the inital £ goa) positions of & pazle board given below \ aft [2 [2 4 3 5 st 6 | 4/8 Gah tal Goal do achPeve -the Goal the eperations perfor i, on ental stale Ys shown below 6 dn the above Spare se Gabe-ftod “he soletton. 8 look atthe Solattons ; oe gore ‘ng possibthey af ache? ving goa)" 8n Stub So]zitions former ip Eperaitior dhas by porter ake lie per geal 8 show? Ioelors of left aperation 6 20 aft 4 Ss 61+ |é Left down | 7 Rgbt \ ap. | | it Belial] 2UPy| Als AG 1 [say [aL 6 é él fs | fe pt ted & | 4p {1 BIAS bl Fp RaseTs act : ; | era | D soe the problem | 4. Oefone the problem: Identity Shtial and -fnal states a Analyxe: the problera: q check ohether we can aebleve Goal stale 5 Sdenti fication of sofation: $ dently which Operation 70 be per-tormed.on we fnttial state A check the best solution: ty \ gee the Obratned solution whether we.can. achieve goal br choose a selb solutton—fore sobich we can athfeve Soal- Me ~ blater Jag problem Fray oe Krave tio Gauge af capacitey sil gource are Ynttal state ov starting state (010) , desfin- ation point to-find 's (2,0 Do reach the desbraion to reach we use Three methods: 4.-fill a) re 3. banster (a0) | (5.0) (or) C010) (0,0) (oi0), 00,0) x x x Empty transter| (506012), > - (s0) (16000) (sy (, £0) t ( kus ie oD) ne) Co) esa) i) (so) ca (ow an) & 5) od 7) a[F Co) mont Hy PONT : tsa NF 2 ‘ isa) ony eee : eP a 009 stom oho er ee, tsi) to) (60) €sy ts 6) tw) Cow) Ge) 48) oa) (uio) (so) Cun) 0,0) C40) (or4)," Cuv0) x ow x» xX x] x ‘t0,0) ay > (s,0) 2 014) _ C84). COW fers myer : | 10) (44) Lid C0) Cu) meer rot] G i) (ow) i) o) (on) (si Coury (4) C40) CHIH) Cd Cd = (0; 0) | ts) 5 (04) | coy) Cn) cue) Cuno) cuy) kev) | Cond tha) . (01) : or 053) tp Eeclae! © tow ) 5 w) e (sa) wy (oe) Cony Cut) od - 60) tod T I (su) aw) C0) | Cod an i Cow eda) ts) t.3) o—__—“‘ (Si) rt Cou) (a> | | (si) Cn “ee | Go) (uy). Re ie t0)) (53) le ey leas: (6) (0,3) | | “On (3,0) (24). i (30) ae { 94 5) Agath ( Cou) (ay) (Oyn) 19) ) (Go) 1) eMC @ (219 69 (68969 (08) OH) (os) (0) (00) (50) Con) cross cou) ay cw) two) ; qui) (o,) o ts) ae) ty (3,0) (22) D0 acheive Kource +0 destiaration ie C010) to (20) we have performed Sill, empty, qransfer operations at specific points as shown Bn figure above roblens: se fave W100 figs ast and other si. Our task P A L . £8.40 Geb 4 [ters water, Sn the five It Gus: Source (0,0) desfreton (40) 010) (60) (0/3) (019) wn tao) (om : 7 is x ¥v » 0,0) = (5,0) . (3) (s0) . : (0,3) rT To —T (s0) (S13) (ora) (s,0) 23) (510) (63) (013) (ors) C018) 6013) (0) x » FR BS x ¥X XxX ve . (010) g | (10) (03) (6) % 02,8) GD. Gd ts, 5 x (13) ¥ | ko Teh ade be ke te (53) CED (1) (60) Cod) C53) (65) (43) (013) (210) C5) Ge) | Ne eee eee eee 63,0) Ut) qitigastas (5,0) e (0:0) (3,0) (0/3) (3,0) x x x x 4 6/0) | = > (60) (0/39 | al oe 03) day G0) Ves (210) ( (3/3) 1 + (2,0) 1 id aa 13) (610) (210) (0,2) (2H) (6:8) (3 (0920 CA () BP a“ ie &e Se ea 8 He, ee (010) = ¢si0) (0:3) Loh ( (93). tna) O89) “we | | hs 1 (210) 1. fi 3) | ( a (0/2) ee (0) : ds) eee } cha T (52) (013) (012) Cor) (02) (20) Con (S18) Con (OH) G3) Or) YX cay eK By mM (0,0) 2 : (5,0) TD) (63) G3) 65,3). C30) i a (2/0) (33) | (0,2) i) 5 poe fa (G2) ty tse) (on) (5,2) (G53) (oy 7 2 ] i id ba & va) (se) ty (5) Co (ove) 09) (0,0) tse 2 , 03) (6:3) are GD 63.0) | | au) (3)3) | It 012) b oy GOSS ey ey Poses) | (4,3) / (3) Cue) =| 1 J TT 69 4D Ea) tw (9 bo naoeonnes on) Wo : (0,0) > tsa 3) 63) 03) 13/0) a | On) (33) | | (012) (o) ) i] tn2d Con) he, = (493) oe) C40) ¢n3) In achteve source to desttratfon fe 60:0) 10 Layo) we polorm Spl), transfer, Era pt? operations as shown Missinanfes and cannibals problem Condition: mde Boot Meecee Ea River Deere ete emer tee errr eee eee ON" SS J Bee gee J. mmc cB | 2 yumee 2 | | 3 vam = —_¢o Bs gece | 8 | AW MMMe@ &————- ¢ | a MM 8 | Me] —————3 mmee go & mmce CMe Fg ah ce — Grits Mme | S B63 D> ESF SG65Nn?> IO rok A Ye —— we can also solve water Gu problem by stag BFS | Here Soemce park is Cojo) and target C20) 0,0) 1 i : (5,0) Covad ri | (sm) duu) 4.0) (10) ca) | (0,1) 5,3) (81) 0,3) I. (9) 63,0) | oo) Byes Lepth first search (OFS): Here caploftatton was done onthe depth yer8. cally On ee Smace Ch Here ane mag take less, me to reach '—the destination but there 2s.a Asadvaniage of Getting | the Gn Sete loop- } | Here prs ave used 10 check the water GS problem, Ey: (0,0) LN (60) coy) | 7 (S49) Ey: fo) ve 1 eso) a). a (Say tte) Cho) — ODE OS ad. | (611) Cay) C20) = Uatform cost search (6) @)” ro” FIA+E ‘2 Fee (ey hye ae OF GIG" EW) wre” Li" = close Ret: UY ¢" cof (0 ca” oo” ony Sra ars sty 214 Ofom cost search mot Bri: Sind ene path [from Zonkthal mode to goal mode bab 8 rhil-Sene an We alternate part. ‘ “a Cntform east search p08) provide oneiliioays so teach goal but wéth the lowest cost. — de means Search'nk from too A2vectlons ie : Forward dPrectton Backwer direction fonvaid: Searb2nb rom root] 2n@tal ede 8 perform Bis &n forward search Bachword: Searchng from Goal node We perform . brs 2n bachwend dErection 0, 2 Saftral fo WOE | cea backward A-B H-T A-B-¢c qe-ree A-By a-tle) dt means there extets a ph 10 reach gor). ive Sf we reach the common mode» 1 ee “| a Db Chepth émet seaveh): Shes aalgorPibm zoas developed to pver come the drawback of BIS: - Below we are elabrale an example 10 reach foal stale fom Ceol stake’ by BPS mong ase of lackbackag VF wieder SPE vs pth AB DHTE Fp eri MG fis: overcome the drawhach of Bs we using the seardinf strater6y called Depth me search Ea: ost Q @2O00W 0 Here Our Vrrkk -2 Me we search or the goal node upts tevel-2 level level t ©. @) bevel a 0 wae ' KR Y BS if F Jy oc, dhe searching for the goal mode by backtracking fs shown above the drawback here te Sf our goal node Pe rut within the (fmt! then we cant yeach goal node ahas we say Sf a some stations depth met | search és ncomplete: | Siterative Bepenin§ Ors: -@ completed Li ndit - 1 AA mC A A ee ® ~~ Be Ae tie © 666 Best first Search Ustnb “this searching strategy ye veath the mest node plBch has best cost i-e tow cost EX: ® 2 $ é th sencliag cading goal stotefiowm Setlal stele rising Best Strst stromag) bey berersverching $8 depfcled below hoe he path 10 qeach the geal node 8 A-B-F-D-E -o- HHL path cost - 45tetad 2434) = 28 wfthons Pntusion or shl the atmost minSrematn cock yo reach B18 node Is A-C- HT = 243) =o Bat by wig Best-Srst search the path cost $2 120 high to reach goal stele * Creed g Best First search Here, ae, obtetn ihe path wast based on heresife —fanetton « dleitctiefanction flr) = blr) hen) = estimated cast of tom ang ene 'n! t0 ee cheapest path the goal node» = - ern nnnenenenenaee 7] Straight Ifoe Pistance : ‘ Mistance bho center of one node to center of another nocle as clepicted below 0—0 h value based on SLD ees (Mery) yable war giver as by using the Greedey Pest ah sth tbe “help of backtracing ave rach the geal node ar shoton below as parb eter rbned ading heentsthe function it ACT 5 | nee the path cost: 2th =8 skill al most min cost to reach ech) pith oa Gnteision 07 Avawback of best that meant 9¥ doesnot eltosinale the farst search completelz) belt partially Jaca cleaner fre dhere are 8 cteites $n Veucam cleaner problen 18k RSR LER RSR eis vo Ree T 4 1 1 [ve pirat ! Ise “pee Latzorel S| [ve] [ore]: ———— 6 pit | | [we] isk ask + 1 Ve [vel LR. + Rsk 1 z ; ve Here fablow drawn $s the Srttial stale | oa tae; Gey} Appl a three eperations Move left Move right clean om zing stale +0 veach the goal nocle- tere the beloo-figere feptets. how we achieve goal bale fom @xttial orate zs ug ae lve] | Move left action t I [ve] ore] + | AS vaccum cleaner is in left de room on pitino wove left aeton there wil be no change of stale. move a7ght OD perforeling Aght eperatfon vaccum cleaner will be Moved 10 vibbt side. 700m clean | ve Lael { By clean left wom clean at Ve, present tnls AM dente bch Ge given Below : Seong Move right “vt gtate@ Move left cleah | | Move «ight ve Dit rt 1 at state) a ape ee. | ' Ww ore |» [ve] | Move left j i __ #3 | [ve] fore : ; | i | | Move aight | | bate | to[ve | clean i 4b state® { ve} pee move left Ave} | [oR] |. J gb - 1 move ve i : [ee] [ome] clean RT ' vi ke] at state (© i ve] [owe | | | ' ~ Move tefhe Move [apt elean AL stage @ Move left Move 776bE clean AL stage @ Move left vel! ' Move aight ? (wel clean Mankees- Bamana problem Here the $n@ial siete es monhe dior freem and ~the goat state 4s ook the banana as Shown below. “1m veri : potting arte Kets window ste Fm choosing climb the bor and gat the banana she actons performed to achieve the Goal state Fro, fnftial stale ave walk push cl’mb Srasp the fellovoe cue the states showed toachieve “be Goal state are shown below | i so] $atifal state Here Stitalk monkey &s at the door Stale 4 8 pushing the le moonesy enters 2n to the 700m Gale 2 =O = Monkex thought and decled wo getthe banana Seneath funcler the bor State 3 I Here moony pushes the box orrongly 0 that the box veversé Or Sormersalt. Brat tapes] GF As Was Teves. Sfale-5 [as the monkezy peshed the box, the bot contairfing bararas| “Hoe the monbeg elfmbed the box. on other case monbex reaches the banana bey kmbing Jorthat we fave 10 performe fou actions eee wT 58 State-6 tieve the monhezy Grabped the banana cand 2n tam Ft Got the banana. walk push clémb grasp . athe seatee to reach the goal state from she tga state yy ~ tere “the monkey watts at State -2 Here the mmonkeg entered the 1000 by pushing the 007 . Here the monkey thought and decided 10 ext the borrang Kang&n§ to the cel hng af the vroom- Staite -y ay Moher Afmebed the ce leng Stale -5 RD che banana AF aench Ponkery Srasped the banana thus monkey gor Fe } }} — 2 A -SO) =gln)+bln) =0té-=8 g- Ft) =gCnyshln) = t10.=0) e-Flr) = gtn)thind a 2tyeé 0 - flr) geri bln) '= BAIS 223. E-fiy) = gengahin) = Wot =24 F- Fe) -6(n) thw) = 6412518 6 - Fin) = gln)4 ha) = 6tt =I a -fO) = 80+ hun) = St? =F I +fi) -g0)4 hind = 8108 zy -t&%) gtr blr) = 4 tld 14 Now by the hecuistic function bases the | do pt algnithon wwe seach the net node best Ini heantstte Value» Sere the path 40 achieve geal node Fron, Enftal node depends on heudshe function. ble calcutate tp, path cost by see nt the Gbven Graph Here we ackteve-the goal state from ErGbal state sity mernram path cost thas eleriénabing the drawback of Best fist search and Greedy Best Fist Search- the drawlsack of py prarch 28 we expand more A more modes, causes 10 wastage of memory and time Memory Eoended at (at) search fir) = ¢)+hlnd 4 73 2H ig Nod by mat search 6 8 6 (8) 3 + ea +C2) 6 46 > x6 she) ¢ 6s — dn Memory bounded 4t search Stratergey will. elemE&amte | the drawback & A* pe expand ?nB of moe nodes 10 | aeteve the §0A) state Sn tern occeping tanger memery. Gn mat we put the Emo sp the no-of nodes 10 be present Inthe graph whtle achtohng the geal node. Sn ove given example we set the beend or Rif ey ive while serching Ser-the goal node there should bea ratmun of foor nodes Fa -any state af the graph wblle nocles = Sn perv present oxaph, $f we want to add new rode then -the condtiion $9 We Sil zemove the existing mode $n-the graph whEch has highest heefsfic vate H1-t00rd LOA (Fterative Bepentng At) fln)= Slr) + hen) fla) = O14 =F fle) =241) =3 Se) =19 3 x4 Flo)=Hto=4 . ~] FCO = sii ee roa | FCA) = 429 scone graph By xpe* (Qt threshold =4 threshold > fore of anede 1@ © ha 323 @ wt. ¢ expended eo @? the expansion pver fore then G0 for B* BZ asa at 4® © 4 “ Beapanded 6 ‘ 4 O34 , —_—$—<$<$<_$ L Jn TOA* we wil) expanded -the root node Sfrst then pe wil) set the sthreshold value nothing bal rintrram f sco of ings node abthat carrent state of Braph the condtfon t0 expand any node ts Threshold » S-score of wang node» | Recen five Best Feast Search (RBFS): Stn) = gn) th ln) SO)! ore =8 fle) = 10 = : fléy= 24426 . | -fCn) = 84S =25 CE) = 1044-24 FCF) =6412=18 (6) <64+# =13 F(H) = 542 =4 (1) 2840 =g 1 #(9) = lota=lg -f-store graph dn RBrs Strategy Wwe rll woK-forthe alternative path. She heafiste calue of the artermatve path 2 vorttten on “he node etpanded enclosed 2n-a box. she cbilds of “that Tode wWhFch soos expanded must sattsfre the conclton P- Sc07€ yalue 2 f-scor value of ales nenive pam Froblem selvéng ce ( Hea for -Pindenh answers to unknown sPraattons - Shere are —four steps for problem solving a6 “follows : 4. Understanding 2. Pepresentation 6. formalahon 4, Sohhin§ 4 Understanding : A tale 2nfial and final states 2 Representation : . dt fs noling but withing all the pastble series shSch we come acress hile Solving the problem elageametie- alley er $n the-fom of Pmages and Sntegiatin the nétta _firal states. : : 3- formulation: dhe methods gy actons used to solve the problem. 4. golving: Smplementation of actions [methods an different states on the Braph. we solve the given problem. Er: vaaum cleaner for problem solving we need 4 steps 4. understanding : ontta] sale : tha house there are a0 reoms ysheie both ae and Verccum cleaner $s present fife of one room. - Goal stale: he 600 “r00Ms masebe Jean and vaccero cleaner 2s present Ga ePthenptvoo rooms. a. Rep resentation ; 4 | (2) [oe] Gee SH — | eT | he) ee] ———— . | Ad et eh | . ‘. ! a: ea viet [adh [Bee SS —--——— Sis ve] [Dre | ! 3... Tormuahon: Sere we use three methods - acces: me, Moveleft, Move ght, clean Foblem Reduction he process of decompostnk a complet prblm Sn toa set af sub problems, sobfeng them and shen Sntegating all the sub problem 10 get “the soln of the problem. Ee: Seveloping the sho 2s our problem: roe feust decom pose Frio] cnrdules. clevelop them and. eémblne a the mectuks to get athe aeqaived shoes shown below aS fos module module module Mecomposttion Here -the problem n 78 10 pss the exam Sor thy ablem reduction $s done as shown below: “he pr i Paws era no y perlerm wey Bocheating — Bo ited an o907k oR lee ~the problem $s 1 negilre Ty set for that the problem seductlon £5 show below -—_ Acachrve , ‘ S40 bbtclin the Goal ctaile Woe cap etpand B tndivideall} oF Ne can expand both exo commténely based en the bert vakue of hea s?o—fencifon 8: fh) =6 CD FUN Ce) +400) CD) = pons HIF BH, heentstte Value of B ze ,p thus we epend B | Alple beta cpreiag | | oan L | LO MiAr aN ™ 1 ai _ | 6 | a me eed TS Pa A d RRRAP 7 ob & 4 8S | | } , | \ | Ip alpha beta prouktng there are 1100 teams & | 85 rin mun | | and Bo means matemum ote mat 1B lie pemen Sniialley zoe tae = — 0d) pO Every level of the given raph fas value mat, win, mat, nn, .- ..- alternatively ying node hitb ther childs from above akl-3 comp ye achfeve -the graph 7 “ete. bo man tevel tea oe f, Z. | | ite > Lo MAx (-1 MIN \/ f ose nh $4 erin EF Nea woe fave to compere the igh child 1 pee 60 MBER. 6-9 pax we 4 Np E49 é5 pi p49 g * 10 compare gam whth + pat shen B=7 Compme 1) Prt C F411) b~2 pany 01-4 uy pole MAX ts min AN io 0 J peg ss pinnae Ft Now of =S compere with fght child 5, aa 0: 23) . eG 4 pro Jo MAX L-1 MIN amar of PP io we, e pamil ns 7 nos 49 § 52 NI aRRRIRe above wrih ebild Be compare pith oo,F pet Now compare the compcve-the ‘ght chfld new Be = compene 8B Spt C82>#) © 8 F ynegssnn 198% wo 2 10 top row = ~g0 compare — 00,7 Ret Clo 24) 0 Lt MIN _~ Po] pa MAY » \, Ls MIN 4 A ase Wd bs Fu Beres RNP Ueno compare por with a ~ BF [-2 MAX 2 wt y 0 t3 pap HARARE R 1 mnie F 0 bea eee q oc ie = 10 may oF BN 7 Np &% 65 s4 MAY 0 dnpe aes runret Now we upelate ~he child value of lett side Se Pr gress 2 of $F ub eg Bea ny 6 F compare peng - pt no 129 lo se NET esp Game plag eng Game play? 1B can be deflned bythe following four steps 4. Gnt8al stale 2. Sueccesor function | 3. Goal stale Ay path cosk i Prkfiéal Antegence fas conBnued 10 empire sath MMi [hm tra coe canable to -teil the dPfference bhio compuleh and fiaman beng A game must-Itl] mataral #f #t-follows the —follonding 4. obey Faws of the game 4. character names 3. path -fendtng 4. ectsion making 6° planning Bifferent tapes of Computer Games ae Skoatergs game ex: chess, tudo St fs aturn based game Piplegp ees: single cand Malti plager game . Y . ev: tents, Stevie Hetlon Fame: Ex: wwo& , zombie Sports. game: bashee ball, tents, orfek et, ete Snrctation : pubg.ftsee-Hre, eal of duties: Adventure Game: subsea, eerfs remplerun pugele game: tick -yac-te, brain broom, sedoko - Conatrefot Sattsfacton ee WOA- westren Austalta NT = Noxtheren “Terfitar T -"Transevelvevta O =. Qeteens land 2 NSW- New south whales 6A - South Austalea V ~ Veetota Problero: we need t0 color each repfen pith R/G/8 sucha aay that mo nclghboedeng reasone have bare color Sblation: 7 Vax een och here the conshaiintsts Brat no adighbeartng reasons fave sare color, ~~ ahi) 4 oveaesisc Varia bles.are: WA) NT SAy ay Eb, vs Tasmania” Lomein : | Ry 6B) fet ioe provide the soln by satis typing conewoh ¥ 2 Shown below tn the rable Boman \ ya | st se} @ tpsw] vo [7 # RGB |e}Reie |} 6 | 4-Dueen protien. . | g.The AOueend problem consists of pladia§ y- Queens sh) Seine | en 4x4 chess boord: sothat na twp queens ca" captuze each etherl'-€ no two qzleens ze zillowed +0 placed or thé same 70 same coleimn and same diagonal)” 7 uv ’ : Aanuih ae gates seit skepa if - oo * lay l ae wy 2 sEEFE - J Here we place the Queen tr 1%colmn& 2 vow te y Step-2: | * lo 3 4 Q pth. we place Queen fn 20d eaimp and 41 r0w 2 2 4 btep-3 — P33 ole) lor 21a 3 4 ® 0€ place the Queen Os %n 3” column &-ftrst 70% 12-3 by e 1 Skep-4 Qs 2 lo 3 oy A Q@ — we place the Queen Oy fn Peotamns 74 vows " | |. 8: Ge Jeteens problern Probleny: the. 8-Oueeens, problem, $5 the’ problem of Pladn§. 8 Queens op 8x3 chess board Sach that none of them ‘attack one another{i-e | NO two queens ae $n the same r0W, same colar end dPagonal). Sol: 810 | 7 | a Ry , SP xa) ashe Step- 4: A & | yt \ q 3 2 f Pw. de pH Here frst Queen $p placed in a™olemn and G 9000 fn 8x8 Git chess board | | 8 ou Lal 1 Stepan, 6 2 [ow SE of eb fron at vfely a = f yee 24 Queen 28 placed on &'?colamn and a",o0 on 8x8 chess bead. abe def Fh 5 | oy | | a 4 step-3 Q wow em 1 a Here Queen Os placed an e™ column and 1700 on | 8x8 chess boards SF i) Step-44: a > «¢ de $6 b ‘ 8a, Ld, | 4 ; | 5 4 Oe 3 oy | 2 aa al ote 43 aoa Ooreep, Oy placed sen: PP skaree ard £4 70R (07 8x8 chess board. be Oy O|@ T Here we pleree the 5” Queen er e” column ard 6 vom en 8x8 chess board. Step-6: abede + $45 £10} ‘ 4 6 | as| £ be Ma QQ 2 a > a ¥ Q tere we: place ‘gM queen on “Ye aid on 8x8 chess board. \ nf Se | Fe axis slept: ayigiy y : | abedef gh | 8 | 0) pesos Ay on ‘ Os 5 4 Qo 1 __. 3 ay ? 6 iy Os oth Here we place the F” Queer on GPeolump 70% 00 @xé chess board . olep-# a_ipeic d Me ti $b 8 | 0) g F | oF 6 Os 7 WA Sy cal 4 | : 3 By , I 4, & : 1 | Os tee we place “the Queens Qe on hea lamn and eo | vt | | 8x8 chess bord. Problem characteristics 4. $8 problem decomposable! Steve the maen problem os decomposable nto sub problems where the solufons of these $nto sub problems are combined ty get the soln forthe marr problem. Ex: problem 28 slim development as shown below Sho f- main probleo mockele rnedule — module. 2: Can sotatfon steps can be @gnored 67 undone? tere woe fiave ~three “Wings b 4. SGnovable 2 Recoverable 3. Srrecoverable 4. Ignovable: bhhile soltin a problem some steps can be Pnored i.e wethout Smplementing them also wear solve the problern- &: Leclaraton of vahables are not does not cae? ang effect solding the problen ¢n python 2 Recoverable: GP wb cain” Yothe ‘done “soork: /andone’ Ss called vecoverable. Wa Ex: Fellin§ onl@ne forms atl rs 3. Srvecoverable: Here the ‘done’ work cannot be ‘emdone’ Ex: let banking, ph pagment 4. 58 -the unbrevee predéctables ‘Here we bay sthe people, ledeng in the upivat blerns and canoe can predtct-the soln Jor some p70 pothal we predéct “the soln Sor Sore probler4 pased Abode the problem as 4. Certehin Buikeorne : 2: Onlaidin Burcoree. 4 4. Certefn Outcome: ere the problem whitch has a soln $s called problems vith certain putcone- Ex! Tie -Tae-10e 2. Uncertain Outcome: She. problero which may @) may rot be loed come under problens with antenialn ubcone En: Sclenttst6 evaluation 61) research 5. 98 G00d solution £8 absolute’ cor) velaiives Abso bute: Here Sind’nB rhe goal node rhith onbnk-rnem Path cost. : Relative: Find?ng the goo! mode by any way tor) 27Y Means. ‘\6. Is soluton #3 a state a) path? Lo State: Other than Gnttta) bate there will bea change of skates phen parBealar actons are performed. on any of the states- path: : { path £2 notheng but collecBon of States - rth 284 Solo but not the state for any given problem: * 6. Boes the tash require Lateraction with a peréon? Nok ai) stteatfons need conversation vith hrurn bat some task I?he hraman deagnosis 7eqzhred. a conve} “z8ahon between faman and machine - TWO player game penformance are lager game -follovas he. 2¢%0 sum approach er sum: . SH one °. : ; plager WMS that shows the ether plager was lost and Leeversa- Ibis concept we called $+ as 22705Ur7 Agen: howtea the . , eine element isblech performs progece/asorks % Know aS Agent \ 6 Jn tao player game there wil be toe agents. She £4 -for.-t00 “phages game $6 tle-tae-toe as “plained pelow. - Ex: -tle - tac-twe

You might also like