This is a project for CS170 Introduction to Artificial Intelligence at University of California, Riverside. It can solve the 8-Tile Puzzle, and can easily be modified to do a k-Tile Puzzle. It does not work with unsolvable puzzles.
The project uses search algorithms such as:
- A-Star with Mattahatan Heuristic Seach
- A-Star with Misplaced Tile Heuristic Seach
- Uniform Cost Seach