An artificial intelligence that solves the sliding block puzzle using A*-search Algorithm. It takes the board's initial position and the final position. From a certain state it moves blocks one unit at a time, namely right, left, up or down, to the empty spaces in certain combinations to get a certain block out of the grid, i.e the final state.
In this project, Manhattan distance and direct Euclidean distance heuristics are used. Those heuristic can be set while giving input to the program.
