scientific article; zbMATH DE number 988820

MaRDI QIDQ3123646zbMATH OpenFDO

Authors Aviezri S. Fraenkel

Publication date 9 March 1997

Full work available at URL https://arxiv.org/abs/math/9503222, http://www.msri.org/communications/books/Book29/

zbMATH Keywords

combinatorial gamesdivide and conquer

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) 2-person games (91A05) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• scientific article; zbMATH DE number 5145315
• scientific article; zbMATH DE number 863512
• scientific article; zbMATH DE number 2214423
• Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp

Cited in

(10)

• How far can nim in disguise be stretched?
• Adjoining to Wythoff's game its P-positions as moves
• Trekking in the alps without freezing or getting tired
• A new heap game
• Complexity, appeal and challenges of combinatorial games
• Games played by Boole and Galois
• Adjoining to \((s,t)\)-Wythoff's game its \(P\)-positions as moves
• Three-rowed CHOMP
• A general upper bound for the runtime of a coevolutionary algorithm on impartial combinatorial games
• Nim with one or two dynamic restrictions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3123646)