Your goal is to sort the matrix from number 1 to number 16, with minimal number of moves.
For the resolution of first matrix, you have to make only one move, two moves for the second, and so on, until the matrix n.8 that needs eight different moves.
Remeber that you can't proceed with the following matrix until you have solved the current matrix.
If you flip a number on the left, all numbers that are in the same row and column of the selected number will be decreased by 1.
Similarly, if you flip a number on the right, all numbers that are in the same row and column will be increased by 1.
Remember that when you reach the value of 16, a flip on the right side will restart the counter from 1 and similarly, when you reach the value of 1, a flip on the left side will restart the counter from 16.
You can scroll through all your moves back and forth, but remember that if you make a new move (e.g., if you find a shortest path), all subsequent moves will be deleted.
- code improvements
- 12.1 MB
- Update Date:
- Giuseppe Cigala
Safe to Download