In a chess checkerboard, there is a king in one edge. Player A and B take turns moving the king to any space that has at least one vertex in common with the one occupied by the king and that has not been visited beforehand. The first player that has no legal move loses the game. ¿Which player has a winning strategy, and what is the strategy? ¿What would happen if the king were changed to a knight?
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.