Skip to content

Latest commit

 

History

History
6 lines (3 loc) · 474 Bytes

README.md

File metadata and controls

6 lines (3 loc) · 474 Bytes

This is a python code that solves N puzzle problem using A* and IDA* search algorithms.

N puzzle or sliding puzzle is a well known problem that consists of N tiles. For example, 8 puzzle have 3 rows and 3 columns. There is an empty space on the board and tiles can be moved so that one can reach the goal configuration. This project was given as the first homework at Artificial Intelligence course.

For input/output, heuristic function and tie-braking, read the pdf.