A Java-based implementation of various search algorithms to solve a marble puzzle game. The program finds the optimal path to move colored marbles on a 3x3 board from an initial state to a goal state. The algorithms implemented: BFS, DFID, A*, IDA* and DFBnB
NxM-tile Puzzle solver with A*, DFID, IDA* and DFBnB algorithms
A Project demonstrating the Search Algorithms: BFS, DFS, DFID, A*(AStar), IDA*(IDAStar), DFBnB
42 Algorithm project that solve n-puzzle
Solving the 15-Puzzle sliding game with informed search algorithms and various heuristics.
Add a description, image, and links to the idastar-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the idastar-algorithm topic, visit your repo's landing page and select "manage topics."