Octal game
The octal games are a class of two-player games that involve removing tokens (game pieces or stones) from heaps of tokens. They have been studied in combinatorial game theory as a generalization of Nim, Kayles, and similar games.[1][2]
Octal games are impartial meaning that every move available to one player is also available to the other player. They differ from each other in the numbers of tokens that may be removed in a single move, and (depending on this number) whether it is allowed to remove an entire heap, reduce the size of a heap, or split a heap into two heaps. These rule variations may be described compactly by a coding system using octal numerals.
Game specification
An octal game is played with tokens divided into heaps. Two players take turns moving until no moves are possible. Every move consists of selecting just one of the heaps, and either
- removing all of the tokens in the heap, leaving no heap,
- removing some but not all of the tokens, leaving one smaller heap, or
- removing some of the tokens and dividing the remaining tokens into two nonempty heaps.
Heaps other than the selected heap remain unchanged. The last player to move wins in normal play. The game may also be played in misère play, in which the last player to move loses.
Games played with heaps in this fashion, in which the allowed moves for each heap are determined by the original heap's size, are called Taking and Breaking games in the literature.[1] Octal games are a subset of the taking and breaking games in which the allowed moves are determined by the number of tokens removed from the heap.
The octal code for a game is specified as
- 0 . d1 d2 d3 d4 …,
where the octal digit dn specifies whether the player is allowed to leave zero, one, or two heaps after removing n tokens from a heap. The digit dn is the sum of
- 1 if leaving zero heaps is permitted, 0 otherwise;
- 2 if leaving one heap is permitted, 0 otherwise; and
- 4 if leaving two heaps is permitted, 0 otherwise.
Zero tokens are not counted as a heap. Thus the digit dn is odd if a heap of n tokens may be removed entirely, and even otherwise. The specification of one-heap results in dn applies to removing n tokens from a heap of more than n. The two-heap results in dn apply to removing n tokens from a heap of at least n+2, and separating the remainder into two nonempty heaps.
Octal games may allow splitting a heap into two parts without removing any tokens, by use of the digit 4 to the left of the decimal point. This is similar to the move in Grundy's game, which is to split a heap into two unequal parts. Standard octal game notation, however, does not have the power to express the constraint of unequal parts.
Octal games with only a finite number of non-zero digits are called finite octal games.
Particular octal games
Nim
The most fundamental game in combinatorial game theory is Nim, in which any number of tokens may be removed from a heap, leaving zero or one heaps behind. The octal code for Nim is 0.333…, appearing in the published literature as
- [math]\displaystyle{ 0.\dot{3} }[/math] ,
to signify the repeating part as in a repeating decimal. It is important to realize, however, that the repeating part does not play the same role as in octal fractions, in that the games
- [math]\displaystyle{ 0.0\dot{7} }[/math]
and
- [math]\displaystyle{ 0.1 }[/math]
are not identical, despite their equality as octal fractions.
Kayles
The game Kayles is usually visualized as played with a row of n pins, but may be modeled by a heap of n counters. One is allowed to remove one or two tokens from a heap and arrange the remainder into zero, one, or two heaps. The octal code for Kayles is 0.77 .
Dawson's Chess
Dawson's Chess is a game arising from a chess puzzle posed by Thomas Rayner Dawson in Caissa's Wild Roses, 1938.[3] The puzzle was posed as involving opposed rows of pawns separated by a single rank. Although the puzzle is not posed as an impartial game, the assumption that captures are mandatory implies that a player's moving in any file results only in the removal of that file and its neighbors (if any) from further consideration, with the opposite player to move. Modeling this as a heap of n tokens, a player may remove an entire heap of one, two, or three tokens, may reduce any heap by two or three tokens, or may split a heap into two parts after removing three tokens. Dawson's Chess is thus represented by the octal code 0.137.
Dawson's Kayles
In the game 0.07, called Dawson's Kayles, a move is to remove exactly two tokens from a heap and to distribute the remainder into zero, one, or two heaps. Dawson's Kayles is named for its (non-obvious) similarity to Dawson's Chess, in that a Dawson's Kayles heap of n+1 tokens acts exactly like a Dawson's Chess heap of n tokens. Dawson's Kayles is said to be a first cousin of Dawson's Chess.
Generalization to other bases
Octal games like Nim, in which every move transforms a heap into zero or one heaps, are called quaternary games because the only digits that appear are 0, 1, 2, and 3. The octal notation may also be extended to include hexadecimal games, in which digits permit division of a heap into three parts. In fact, arbitrarily large bases are possible. The analysis of quaternary, octal, and hexadecimal games show that these classes of games are markedly different from each other,[1] and the behavior of larger bases has not received as much scrutiny.
Nim-sequence
The Sprague–Grundy theorem implies that a heap of size n is equivalent to a nim heap of a given size, usually noted G(n). The analysis of an octal game then consists in finding the sequence of the nim-values for heaps of increasing size. This sequence G(0), G(1), G(2) ... is usually called the nim-sequence of the game.
All finite octal games analyzed so far have shown a nim-sequence ultimately periodic, and whether all finite octal games are ultimately periodic is an open question. It is listed by Richard Guy as an important problem in the field of combinatorial games.[4]
Computation records
A complete analysis of an octal game results in finding its period and preperiod of its nim-sequence. It is shown in Winning Ways for your Mathematical Plays that only a finite number of values of the nim-sequence is needed to prove that a finite octal game is periodic, which opened the door to computations with computers.
Octal games with at most 3 octal-digits have been analyzed through the years. There are 79 non-trivial octal games, among which 14 have been solved:
- .156 by Jack Kenyon in 1967[1]
- .356, .055, .644 and .165 by Richard Austin in 1976[1]
- .16, .56, .127 and .376 by Anil Gangolli and Thane Plambeck in 1989[1]
- .454, .104, .106, .054 and .354 by Achim Flammenkamp between 2000 and 2002[5]
There remain 63 of these games, despite the computation of millions of nim-values by Achim Flammenkamp.[5]
References
- ↑ 1.0 1.1 1.2 1.3 1.4 1.5 Berlekamp, Elwyn R.; John H. Conway; Richard K. Guy (1982). Winning Ways for your Mathematical Plays. 1. Academic Press. ISBN 0-12-091101-9. Revised and reprinted as
Winning Ways for your Mathematical Plays (2nd ed.). A K Peters Ltd. 2004. ISBN 1-56881-130-6. - ↑
Conway, John Horton (1976). On numbers and games. Academic Press. ISBN 0-12-186350-6. Revised and reprinted as
— (2000). On numbers and games. A K Peters Ltd. ISBN 1-56881-127-6. - ↑ Dawson, Thomas Rayner (1973). Five Classics of Fairy Chess. Dover Publications.
- ↑ Richard K. Guy, Unsolved problems in Combinatorial Games, Games of No Chance, 1996
- ↑ 5.0 5.1 Achim Flammenkamp, Octal games
 |  |
