Thinking about the holidays, we have decided to offer a challenge.
A checkerboard of only 5 cases of hand, then consisting of 25 cells in 5 rows and 5 columns are needed.
As the figure, so to speak.
The goal is to remain a pawn in the center.
The only player must jump (in all 4 directions but not diagonally) laborers and other “aterizar” in an empty cell.
The jump pawn is “eaten” and removed from the game.
Do you think it will be possible to reach a solution to the game?
The solution, when you want to read it, is down.
We write a Python program to solve numerically.
Order the Code through our contact form.
The results are interesting.
Let’s start with a consideration.
In any case, there are 23 steps (to eliminate the pawns 23) in order to have a single pedestrian.
It can not clearly arrives to 23 steps, and, after a bad choice, you must stop before the 23th step…
One way to stay in a single pawn is (remember that Python rates from 0, so 0 is the first row or column) following.
- [[0, 2, ‘S’], [0, 0, ‘E’], [3, 2, ‘N’], [0, 3, ‘O’], [3, 0, ‘E’] [1, 1, ‘S’], [1, 3, ‘O’], [2, 4, ‘O’], [4, 1, ‘N’], [0, 2, ‘S’] [3, 3 ‘O’], [0, 4, ‘S’], [1, 0, ‘S’], [3, 2, ‘N’], [2, 4, ‘O’] [4, 4 ‘N’], [4, 3, ‘O’], [4, 0, ‘N’], [2, 4, ‘O’], [2, 0, ‘E’] [2 3, ‘O’], [1, 2 ‘S’], [4, 2, ‘N’]]
- [[0, 2, ‘S’], [3, 2, ‘N’], [3, 0, ‘E’], [1, 1 ‘S’], [4, 1, ‘N’] , [0, 4, ‘O’], [4, 3, ‘O’], [2, 4, ‘O’], [1, 3, ‘O’], [4, 2, ‘N’] [1, 2 ‘S’], [0, 0, ‘E’], [4, 4, ‘N’], [3, 3, ‘O’], [2, 4, ‘O’] [0, 2, ‘E’], [0, 4, ‘S’], [1, 0, ‘S’], [4, 0, ‘N’], [2, 4, ‘O’] [2, 0, ‘E’], [2, 3, ‘O’], [2, 2, ‘S’]]
- and another…
[[2, 4, ‘O’], [0, 4, ‘S’], [0, 2, ‘S’], [1, 0, ‘E’], [1, 2, ‘E’] [3, 2, ‘N’], [3, 0, ‘N’], [3, 1, ‘N’], [3, 3, ‘N’], [0, 1, ‘S’] [0, 3, ‘S’], [2, 4, ‘O’], [4, 4 ‘N’], [2, 4, ‘O’], [0, 0, ‘S’] [4, 2, ‘E’], [4, 0, ‘E’], [2, 0, ‘E’], [1, 2 ‘S’], [4, 2, ‘N’] [ 2, 2 ‘E’], [1, 4 ‘S’], [4, 4 ‘N’]] - …
The script does not check that the witness is in the middle: you can add this application?