ISSN:
1432-1270
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract A well known two person game called Nim consists in two players, alternately taking matches from a single heap of matches. In our paper we extend this game to arbitrary periodic moving orders, for exampleAABAB, whereA andB are the players. The main result states, that the player moving more frequently always can force a win, provided there are “enough” matches in the heap initially. Thus in the exampleA will win.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01242859
Permalink