Alice and Bob sit down, face to face, with a chessboard in front of them. They are going to play a little game, but this game only has a single knight... Who will win?
I am excited to tell you that I just released the alpha version of my “Pydont's” book, a book that compiles all my “Pydon't” articles. You can get the book at leanpub: leanpub.com/pydonts.
Alice and Bob will play a special game of “chess”. Alice will take the knight and place it in some square of the chessboard, any square she likes.
Then, Bob will take the knight and move it (according to chess rules) to a square of his choosing.
Then it's Alice's turn to do the same, and they will alternate moving the knight. There is only a catch:
They cannot move the knight to a position that has already been visited by the knight.
In the example image below, the knight cannot be moved one row down and two columns right, as that is the place the knight started at.
Thus, the player who cannot make a valid move loses.
Can any of them guarantee a win? Who? How?
Give it some thought...
If you want, you can try playing the game against the computer here.
If you need any clarification whatsoever, feel free to ask in the comment section below.
This problem was posed to me by a university colleague that plays a lot of chess!
You can read the solution here to compare with your own solution. You can also use that link to post your own solution in the comments! Please do not post spoilers in the comments here.
If you enjoyed the problem and would like to get new problems directly in your inbox, be sure to subscribe to the Problems newsletter.
If you liked this article and would like to support the mathspp project, then you may want to buy me a slice of pizza 🍕.