Reduced canonical forms of stoppers

MaRDI QIDQ2500976zbMATH OpenFDO

Authors Aaron N. Siegel

Publication date 30 August 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/128946, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r57.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Combinatorial games (91A46)

Review text

Summary: The reduced canonical form of a loopfree game \(G\) is the simplest game infinitesimally close to \(G\). Reduced canonical forms were introduced by \textit{D. Calistrate} [in: Games of no chance. Combinatorial games at MSRI. Workshop, July 11--21, 1994 in Berkeley, CA, USA. Cambridge: Cambridge Univ. Press. Math. Sci. Res. Inst. Publ. 29, 409--416 (1997; Zbl 0872.90132)], and Grossman and Siegel provided an alternate proof of their existence. In this paper, we show that the Grossman--Siegel construction generalizes to find reduced canonical forms of certain loopy games.

Recommendations

• scientific article; zbMATH DE number 5734580
• New results in loopy games
• scientific article; zbMATH DE number 988846
• Misère canonical forms of partizan games
• scientific article; zbMATH DE number 6468931

Cited in

(1)

• New results in loopy games

This page was built for publication: Reduced canonical forms of stoppers

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