Question

help please. the goal state is provided where f(n)= g(n) + h(n)

g(n) = actual dsitance from n to the start state, and

h(n0 = number of tiles out of place

Problem 4: (A* Algorithm with Heuristic Search) (25 Points) Apply A* Algorithm to the following 8 Puzzle game: The start state, first moves, and goal state for this 8 puzzle game is shown below Start 12 3 3 1614 g(n) = 0 2 8 3 2 83 g(n) = 1 | 283 1 64 75 7 65 75 Values of f(n) for each state Where f(n) = g(n) + h(n) g(n) = actual distance from n to the start state, and h(n) = number of tiles out of place.

Answer 1

"goal state not provided."

But still, I m giving you an example of how to, solve such types of questions. I hope u will crack this one after this example

->The red circled box is the goal state.

-> The root of the tree is the initial state

g=0, h=3, f=g+h=3 4 5 6 8 7 g=1, h=4, f=5 g=1, h=4, f=5 g=1 h=2,=3 2 3 6 7 4 5 6 8 7 5 g=2, h=1, f=3 g=2, h=3,f=5 g=2, h=3,f=5 2 3 46 7 5 8 7 | 5 8 g=3, h=2, f=5 g=3, h-Ow=3 2 4 5 6 5 16 7 18