Solving The 8 Puzzle Problem With A* Algorithm
800293Nov 23 2010 — edited Nov 23 2010Hi Guys,
I would like to solve/implement the 8 puzzle problem using the A* algorithm in java. Am asking if someone can help me by explaining to me the steps i must follow to solve it. I have read on the net how the A* works but i don't know how to begin the implementation in java.
I will be very grateful if you guys can help me and give me the guidelines(step by step) so that i can implement it myself in java. I really want to do it to be able to understand it, so i just need the guidelines to start. I mean what kind of functions do i need, how should i implement those functions. I need some kind of detail description of what i must do so that i can do it my self.
I will use priority queues and will read the initial configuration from a text file which looks like for example this:
4 3 6
1 2 5
7 8
Pointers to other sites for more explanation/tutorials are welcome.
Thanks you very much.