An implementation of BFS, DFS, UCS, BDS, A*, IDA* algorithms with various heuristics to solve 15-puzzle problem.
The search algorithm is written independent of problem (15-puzzle problem in this case) and it can be used to solve other problems as well, like famous UCB CS188 Packman game.
Search algorithms use these heuristics:
- Manhattan Distance
- Linear Conflicts + Manhattan Distance
- Disjoint pattern database