A new heap game
Aviezri S. Fraenkel, Dmitri Zusman
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.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.