Consider trying to solve the 8-puzzle. Can you solve it using A* Algorithm?

Hint: f(n) = g(n) + h(n) where g(n) = distance from n to start state and h(n) = the number of tiles out of place.

Start State: 1 2 3 856 | 4|7 Goal State: 1 2 3 4 5 6 7 8 Start State: 1 2 3 856 | 4|7 Goal State: 1 2 3 4 5 6 7 8