Abstract
Graph games with an annihilation rule, as introduced by Conway, Fraenkel and Yesha, are studied under the misère play rule for progressively finite graphs that satisfy a condition on the reversibility of non-terminal Sprague-Grundy zeros to Sprague-Grundy ones. Two general theorems on the Sprague-Grundy zeros and ones are given, followed by two theorems characterizing the set of P-positions under certain additional conditions. Application is made to solving many subtraction games, and solutions to two games not covered by the general theory are presented indicating a direction for future research.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
