IDA* Algorithm for the 15-Puzzle

Iterative deepening A* search is a well-known informed search algorithm. IDA* is somewhat of an improvement over the optimal and complete A* search algorithm. The 15-puzzle involves rearranging 15 numbered and tiles one blank space on a 4x4 grid.

C# (255.8 KB)
 
 
 
 
 
(0)
496 times
Add to favorites
6/4/2015
E-mail Twitter del.icio.us Digg Facebook

Solution explorer

C#
Click an item in the panel on the left to view the contents here.