Question: please solve it in paper , thanks in advance Problem 2: [20 points] Consider the 8-puzzle problem, where the board is 33 and there are
please solve it in paper , thanks in advance

Problem 2: [20 points] Consider the 8-puzzle problem, where the board is 33 and there are eight tiles, numbered 1,2,3,4,5,6,7 and 8 . There are four moves: move the blank up, right, down, and left. Use A algorithm to find the path from start state to the goal state, where h(n)=3 the number of tiles out of place and g(n)= the actual distance from n to the start state. The start and goal states are
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
