A new heap game
Abstract
Given k 3 heaps of tokens. The moves of the 2-player game introduced here are to either take a positive number of tokens from at most k-1 heaps, or to remove the same positive number of tokens from all the k heaps. We analyse this extension of Wythoff's game and provide a polynomial-time strategy for it.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.