Given a board of size NxN with numbers from 0 to N*N-1. Move the 0 cell up, down, left or right until all numbers are in the correct order.
This implementation uses A*-search with a Manhattan Distance heuristic.
Run
python3 PuzzleGame.py -h
for help.