Question

4. a) When would DFS be a better choice than A* search? (3 points) b) Which path will A* return for the following search problem? (3 points) Node - 80

Answer 1

Find the solution to both parts in the following handwritten solution.

hueblam like Sudeku deaneh breran, itable cheice than A* arch a) In a DFS s me ameunt Then the length the Sufpore the buzzle bagina with digta illed shortest path fired (81-x)L which i min max Avcrage branching facter B can be in the range x(81-3) Suppose -28 L 8 1-28 - 53 and B= 9x53 >> L Hence A* will have serueus tfcal PC be mumary preblem No etimal anch algorithm ffaent than A, bt DFS i net otunal and it en mere can be Lucky Jnchiny gals Can en the Sudeku anch reblam examtle abeve, DFS almaut aluay expandswer nedas than A*, because A naed to expand For 7 L-I Level

In the following solution of A* search,

g value = the movement cost to move from the starting point to the current point in case, following the path generated to get there.
h value = the estimated movement cost to move from the current point on the grid to the final destination.

Parent of a point means the previous point in the shortest path to get to the current point.

h values are given in the table, and g values are to be calculated using the weight in the edges.

b The path rturned ty given dearch prsblem A* ter the is: S -B-G the path Porsces taining Starting toird, G Ending point Updating fvalus Alf) - A(g)+ A (h)- 5+3-8 & Parurt Glf)- G ()+G (h) = 10+0- 10& Parunt B (f) B()B(h) - 2+2-4& Pasart e C(f)- C(g)+ C(h) = |+100-101 & farart B has the loest f value , ubdate f values eit succesdors S = S's uccssBr, A-S G-S 8=S c-s we available trom G i the enly aucceon G (4) Bl)distance betusean & G BSe, since (G0> 2+2) update Glg)- 2+2- G(f)-4 & Paart e G-B we New, beaide S and B, G i the nede with the leweut f value So we update it uccesuou f valuas But Gr i the dastinatien, tracs the path back to S which iu G Parant oG Parunt o (farurt el G 7 choose G to