A new heap game

Aviezri S. Fraenkel; Dmitri Zusman

A new heap game

组合数学 2007-05-23 v1

作者: Aviezri S. Fraenkel , Dmitri Zusman

摘要

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.

关键词

combinatorial game theory combinatorial games

引用

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

备注

To appear in Computer Games 1998

相关论文

查看更多相关论文 →