Skip to main content
Conference Proceedings

A new heap game

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1558 205-211
DOI: 10.1007/3-540-48957-6_13
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Fraenkel, A. S., & Zusman, D. (1999). A new heap game. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1558, pp. 205–211). Springer Verlag. https://doi.org/10.1007/3-540-48957-6_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free