Abstract

Given combinatorial games G and H, define a new game G→ H to be the game played by two players who alternately make moves of game G until G is exhausted and then proceed to game H. As usual, the player who has no move (in H) loses. Misère games are a special case of this construction. We explore the theory of these sequential compounds and determine the outcomes and Grundy values of certain games of this form.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.