Note: To understand the definition of neighbors, in the Goalstate below tile numbered 8, 6 and 13, 14 are neighbors to one ofthe empty tile.
a. Expand & depict the search tree for up to exactly twolevels (level 1 & level 2). (Given initial state can be assumedto be on level-0.). Each transition will add a uniform pathcost = 5 if the empty tiles are not in the same row in theresultant state. If they are in same row the path cost must becost = 3.b. Among the below two defined heuristics (H1 and H2), if you arerestricted to choose only one of them, which one would you chooseand why? Tile in the below definition does not include theempty tiles. Justify your choice with brief answer with appropriatenumerical illustration w.r.t to the given problem.H1: Number of Misplaced Tiles w.r.t to the goal stateH2: Sum of Manhattan distances of all the misplaced tiles w.r.t tothe goal state.c. Apply Uniform cost search algorithm for the search resultsobtained from part a), only till first 5 closed list updates ortill no more nodes are left whichever is achieved theearliest. Show the status of OPEN and CLOSE list at each level andthe step by step procedure as discussed in theclass.
- Consider The Below Initial And Goal State Of The Problem And Answer The Following Questions Given Is An N Tile Puzzle W 1 (376.58 KiB) Viewed 30 times