Complexity of 8 Puzzle

I'm looking for a detailed explanation of the complexity of the 8 puzzle problem. I'm guessing A* would be the choice of search algorithm to solve this.
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

meinnitAuthor Commented:
Thanks for those, I did come across those when I searched the net. They don't state the overall complexity in Big O notation.
Using breadth-first, the time complexity of the 8-puzzle problem will be O (b^d), where b is the branching factor of the search tree (the maximum number of next states from any given state), and d is the depth of the solution (number of steps to reach the goal state). Using depth-first search, the complexity is O (b^m), where b is the branching factor, and m is the maximum tree depth.

Given an accurate heuristic, the A* search algorithm will be the fastest to find a solution.


  Nayer Naguib

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today

From novice to tech pro — start learning today.