Consider the followingConsider the following figures that show an $8-$puzzle sliding diagram with both initial and

goal states:

Figure $1$: $8-$Puzzle Sliding Diagram

a$)$ Apply the heuristic search $A^{**}$ method using Manhattan Distance pathing measurement

to evaluate all branching steps from starting state to the goal state.

$[2\mathrm{.}5$ Marks$]$

b$)$ Apply the heuristic search $A^{**}$ method using Hamming Distance pathing measurement

to evaluate all branching steps from starting state to the goal state.

$[2\mathrm{.}5$ Marks$]$ figures that show an $8-$puzzle sliding diagram with both initial and

goal states:

Figure $1$: $8-$Puzzle Sliding Diagram

a$)$ Apply the heuristic search $A^{**}$ method using Manhattan Distance pathing measurement

to evaluate all branching steps from starting state to the goal state.

$[2\mathrm{.}5$ Marks$]$

b$)$ Apply the heuristic search $A^{**}$ method using Hamming Distance pathing measurement

to evaluate all branching steps from starting state to the goal state.

$[2\mathrm{.}5$ Marks$]$