A new heap game
| dc.creator | Fraenkel, Aviezri S. | |
| dc.creator | Zusman, Dmitri | |
| dc.date | 1998-09-15 | |
| dc.date.accessioned | 2026-07-07T05:26:01Z | |
| dc.date.available | 2026-07-07T05:26:01Z | |
| dc.description | 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. | |
| dc.description | To appear in Computer Games 1998 | |
| dc.identifier | https://arxiv.org/abs/math/9809075 | |
| dc.identifier | http://arxiv.org/abs/math/9809075 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/77397 | |
| dc.subject | Combinatorics | |
| dc.title | A new heap game | |
| dc.type | text |