Skip to content

Python implementation of N puzzle problem using A* and IDA* search algorithms.

Notifications You must be signed in to change notification settings

zeynepozalp/n_puzzle

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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.