A new heap game

Aviezri S. Fraenkel; Dmitri Zusman

A new heap game

Combinatorics 2007-05-23 v1

Authors: Aviezri S. Fraenkel , Dmitri Zusman

Abstract

Given $k\ge 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.

Keywords

combinatorial game theory combinatorial games

Cite

@article{arxiv.math/9809075,
  title  = {A new heap game},
  author = {Aviezri S. Fraenkel and Dmitri Zusman},
  journal= {arXiv preprint arXiv:math/9809075},
  year   = {2007}
}

Comments

To appear in Computer Games 1998

Related papers

View all related →