Solving an 8-tile sliding puzzle game using graph traversal/search algorithms, Breadth-first Search (BFS) and A* Search

Uses Manhattan Distance as the heuristic function for A* search.

Resources

• MIT Introduction to Algorithms Lecture: Breadth-first search
• MIT lecture video on BFS

Links

• 🎮 demo
• 📁 repo