Abstract
We provide a winning strategy for sums of games of Mark-t, an impartial game played on nonnegative integers where each move consists of subtraction by an integer between 1 and t−1 inclusive, or division by t, rounding down when necessary. Our algorithm computes the Sprague–Grundy values for arbitrary n in quadratic time. This addresses one of the directions of further study proposed by Aviezri Fraenkel. In addition, we characterize the P-positions and N-positions for the game in misère play.
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.
