Two variants of Wythoff's game preserving its P-positions
Nhan Bao Ho
Abstract
Open-access reader
Nhan Bao Ho
Abstract
Open-access reader
We present two variants of Wythoff's game. The first game is a restriction of Wythoff's game in which removing tokens from the smaller pile is not allowed if the two entries are not equal. The second game is an extension of Wythoff's game obtained by adjoining a move allowing players to remove k tokens from the smaller pile and l tokens from the other pile provided l < k. We show that both games preserve the P-positions of Wythoff's game. This resolves a question raised by Duchene, Fraenkel, Nowakowski and Rigo. We give formulas for those positions which have Sprague-Grundy value 1. We also prove several results on the Sprague-Grundy functions.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We present two variants of Wythoff's game. The first game is a restriction of Wythoff's game in which removing tokens from the smaller pile is not allowed if the two entries are not equal. The second game is an extension of Wythoff's game obtained by adjoining a move allowing players to remove k tokens from the smaller pile and l tokens from the other pile provided l < k. We show that both games preserve the P-positions of Wythoff's game. This resolves a question raised by Duchene, Fraenkel, Nowakowski and Rigo. We give formulas for those positions which have Sprague-Grundy value 1. We also prove several results on the Sprague-Grundy functions.
Key concepts: Extension (predicate logic), Value (mathematics), Sequential game, Pile, Mathematical economics, Computer science, Combinatorics, Game theory