Puzzle Problem

AI to solve a dynamic 15 puzzle using an assortment of AI techniques.

Performed under a course conducted at Swinburne University for Artificial Intelligence.

Refer to report.pdf for writeup.

Getting started

Run using search.sh. This will automatically build the solver on your platform.

Search file

A search file provided must be in the following format:

1. First line contains the height and width
2. Second line contains the desired start state
3. Third line contains the desired end state

Example:

3x3
6 7 4 1 5 3 8 0 2
3 4 2 1 8 7 6 0 5

Search algorithms

So far, the following algorithms with their respective codes are implemented:

• Uninformed
  • Breadth-First Search, BFS
  • Depth-First Search, DFS
  • Iterative-Deepening Depth-First Search) Search, IDS
  • Bogosort Search, BOGO
• Informed
  • Greedy Best-First Search, GBFS
  • A* Search, AS
  • Iterative-Deepening A* Search, IDAS

Screenshot

Copyright

© Alex Cummaudo 2016