AI - 8 Tile Puzzle Solver
Using A* and Iterative Deepening Search

This project implements AI algorithms to solve the 8 Tile Puzzle: a puzzle involving a 3x3 grid of tiles in a random order, with one tile removed (represented by the 0 tile here) so that pieces may be slid around to reach a desired goal state. Algorithms implemented include A* search (using 2 different heuristics), Depth First search, and Iterative Deepening Search. By using different algorithms to solve the same input puzzle, this program demonstrates the differences in each algorithm, allowing the user to analyze their differences.

Developed on my own in Python for CS 4365 Artificial Intelligence.

​

For a more in-depth description and analysis of the algorithms, Check it out on GitHub!