Created for CS4341

This is a project that uses A* search and Uniform Cost Search to play a game of Sokoban and return either
the winning set of moves or no solution found

the format of a game is represented by

%: wall
B: box on a goal
b: box
.: goal
P: player

The boards are stored in /boards with the solution pasted into solution.txt in /solution

the command to start is:
python src/solver.py --input boards/<board_name>.txt --output solutions/solution.txt