Kayles
Kayles is a simple impartial game in combinatorial game theory, invented by Henry Dudeney in 1908. Given a row of imagined bowling pins, players take turns to knock out either one pin, or two adjacent pins, until all the pins are gone. Using the notation of octal games, Kayles is denoted 0.77.
Rules
Kayles is played with a row of tokens, which represent bowling pins. The row may be of any length. The two players alternate; each player, on his or her turn, may remove either any one pin (a ball bowled directly at that pin), or two adjacent pins (a ball bowled to strike both). Under the normal play convention, a player loses when they have no legal move (that is, when all the pins are gone). The game can also be played using misère rules; in this case, the player who cannot move wins.
History
Kayles was invented by Henry Dudeney.[1][2] Richard Guy and Cedric Smith were first to completely analyze the normal-play version, using Sprague-Grundy theory.[3][4] The misère version was analyzed by William Sibert in 1973, but he did not publish his work until 1989.[5]
The name "Kayles" is an Anglicization of the French quilles, meaning "bowling pins".
Analysis
Most players quickly discover that the first player has a guaranteed win in normal Kayles whenever the row length is greater than zero. This win can be achieved using a symmetry strategy. On their first move, the first player should move so that the row is broken into two sections of equal length. This restricts all future moves to one section or the other. Now, the first player merely imitates the second player's moves in the opposite row.
It is more interesting to ask what the nim-value is of a row of length [math]\displaystyle{ n }[/math]. This is often denoted [math]\displaystyle{ K_n }[/math]; it is a nimber, not a number. By the Sprague–Grundy theorem, [math]\displaystyle{ K_n }[/math] is the mex over all possible moves of the nim-sum of the nim-values of the two resulting sections. For example,
- [math]\displaystyle{ K_5 = \mbox{mex}\{K_0 + K_4, K_1 + K_3, K_2 + K_2, K_0 + K_3, K_1 + K_2\},\, }[/math]
because from a row of length 5, one can move to the positions
- [math]\displaystyle{ K_0 + K_4,\quad K_1 + K_3,\quad K_2 + K_2,\quad K_0 + K_3,\text{ and } K_1 + K_2.\, }[/math]
Recursive calculation of values (starting with [math]\displaystyle{ K_0 = 0 }[/math]) gives the results summarized in the following table. To find the value of [math]\displaystyle{ K_n }[/math] on the table, write [math]\displaystyle{ n }[/math] as [math]\displaystyle{ 12a + b }[/math], and look at row a, column b:
| [math]\displaystyle{ K_n }[/math] | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0+ | 0 | 1 | 2 | 3 | 1 | 4 | 3 | 2 | 1 | 4 | 2 | 6 |
| 12+ | 4 | 1 | 2 | 7 | 1 | 4 | 3 | 2 | 1 | 4 | 6 | 7 |
| 24+ | 4 | 1 | 2 | 8 | 5 | 4 | 7 | 2 | 1 | 8 | 6 | 7 |
| 36+ | 4 | 1 | 2 | 3 | 1 | 4 | 7 | 2 | 1 | 8 | 2 | 7 |
| 48+ | 4 | 1 | 2 | 8 | 1 | 4 | 7 | 2 | 1 | 4 | 2 | 7 |
| 60+ | 4 | 1 | 2 | 8 | 1 | 4 | 7 | 2 | 1 | 8 | 6 | 7 |
| 72+ | 4 | 1 | 2 | 8 | 1 | 4 | 7 | 2 | 1 | 8 | 2 | 7 |
At this point, the nim-value sequence becomes periodic[5] with period 12, so all further rows of the table are identical to the last row.
Applications
Because certain positions in Dots and Boxes reduce to Kayles positions,[6] it is helpful to understand Kayles in order to analyze a generic Dots and Boxes position.
Computational complexity
Under normal play, Kayles can be solved in polynomial time using Sprague-Grundy theory.[3]
Generalizations
Node Kayles is a generalization of Kayles to graphs in which each bowl “knocks down” (removes) a desired vertex and all its neighboring vertices. Alternatively, this game can be viewed as two players finding an independent set together. Winner determination is solvable in polynomial time for any family of graphs with bounded asteroidal number (defined as the size of a largest subset of vertices such that the removal of the closed neighborhood of any vertex in the set leaves the remaining vertices of the set in the same connected component).[7]
Similarly, in the clique-forming game, two players must find a clique in the graph. The last to play wins. Schaefer (1978)[8] proved that deciding the outcome of these games is PSPACE-complete. The same result holds for a partisan version of node Kayles, in which, for every node, only one of the players is allowed to choose that particular node as the knock down target.
See also
- Combinatorial game theory
- Octal games
- Dawson's Kayles
- Nimber
References
- ↑ Dudeney, H. E. (2002), The Canterbury puzzles, Dover, pp. 118–119, puzzle 73, ISBN 0-486-42558-4. Originally published in 1908.
- ↑ Conway, John H. On Numbers and Games. Academic Press, 1976.
- ↑ 3.0 3.1 R. K. Guy and C. A. B. Smith, The G-values of various games, Proc. Cambridge Philos. Soc., 52 (1956) 514–526.
- ↑ T.E. Plambeck, Daisies, Kayles and the Sibert-Conway decomposition in misere octal games , Theoret. Comput. Sci (Math Games) (1992) 96 361–388.
- ↑ 5.0 5.1 Plambeck, Thane, Kayles, http://www.plambeck.org/oldhtml/mathematics/games/misere/077/index.htm, retrieved 2008-08-15
- ↑ E. Berlekamp, J. H. Conway, R. Guy. Winning Ways for your Mathematical Plays. Academic Press, 1982.
- ↑ Bodlaender, Hans L. (2015). "Exact Algorithms for Kayles". Theoretical Computer Science 562: 165–176. doi:10.1016/j.tcs.2014.09.042.
- ↑ Schaefer, Thomas J. (1978). "On the complexity of some two-person perfect-information games". Journal of Computer and System Sciences 16 (2): 185–225. doi:10.1016/0022-0000(78)90045-4.
 |  |
