Using uniform cost search and A* search algorithms to solve the 8 puzzle. User can use the hard-coded default input or a custom puzzle.
Possible improvements:
- Add explored set
- Check if node is repetitive during expansion (check frontier and explored set)
- Only add to frontier if not repetitive
To run:
- clone files into the same folder
- open terminal to dir of the folder
- run the line 'python main.py'