Three Search Algorithms for the 15-Puzzle

This application attempts to solve instances of the 15-puzzle using one of three search algorithms: best-first search (an informed search method) or the two uninformed search techniques, breadth-first search and depth-first search. The instances are not completely random.

C# (329.9 KB)
760 times
Add to favorites
E-mail Twitter Digg Facebook
Click an item in the panel on the left to view the contents here.