The goal of this assignment was to develop a program that implements Breadth First Search and A* Search with two different heuristics for solving a 19-tile puzzle (8-Puzzle).
The search-based solution had to follow the strategy of using a priority queue for the Open List and another data structure for the Closed List.
Homework1-V2.pdf is the assignment given by the professor
main.cpp main file
Board.cpp/h held the state data
BFS.cpp/h Breadth First Search
A_Star.cpp/h A* Search