Store best attempt on each level.
Submitted by Robert Ancell
Since Gnotski is very difficult (#111543), users may want to try and better previous level solutions. To do this well:
a) We need to know the smallest number of moves for each level. Ideally we would compute this in the program.
b) The user needs to know what their previous best is when playing a level.
It may also be nice for the menu to display one of four states for each level:
- The level is unsolved
- The level is solved
- The level is solved perfectly (i.e. in the least moves)
- The level is solved and no other user (from the high scores table) has bettered this attempt.
Version: git master