1998/09/15 by Aviezri S. Fraenkel, Fraenkel, Aviezri S., Dmitri Zusman +1
Computer Science · Mathematics · #Artificial Intelligence in Games #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.math/9809075
To appear in Computer Games 1998
arxiv created 1998/09/15 · openalex publication_date 1998/09/15 · arxiv updated 2009/11/30 · openalex created_date 2024/04/11 · openalex updated_date 2026/07/28
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 \sl 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.