Games played by Boole and Galois

Authors:
Aviezri S. Fraenkel
Affiliations:
Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 5
Cited 0

The Sprague-Grundy function for Wythoff's game

Theoretical Computer Science
Adjoining to Wythoff's game its P-positions as moves

Theoretical Computer Science
Regular Article: Additive Periodicity of the Sprague驴Grundy Function of Certain Nim Games

Advances in Applied Mathematics
Godel, Escher, Bach: An Eternal Golden Braid

Godel, Escher, Bach: An Eternal Golden Braid
Complexity, appeal and challenges of combinatorial games

Theoretical Computer Science - Algorithmic combinatorial game theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of the piles, or a function over GF(2). Wythoff's game is a special case. For each game, the second player winning positions are a pair of complementary sequences. Sample games are presented, strategy complexity questions are discussed, and possible further studies are indicated. The motivation stems from the major contributions of Professor Peter Hammer to the theory and applications of Boolean functions.