The number hides game
Authors: V. J. Baston, F. A. Bostock and T. S. Ferguson
Journal: Proc. Amer. Math. Soc. 107 (1989), 437-447
MSC: Primary 90D05
MathSciNet review: 972227
Full-text PDF Free Access
Abstract: We solve the following two-person zero-sum game, introduced by Ruckle. Players I and II simultaneously choose sequences of $m$ and $n$ consecutive integers respectively from the integers 1 to $p$ inclusive. The payoff to I is the number of integers in the intersection of the two sequences. A continuous version of this game is also solved as well as the variations in which one of the players need not choose his integers consecutively.
W. H. Ruckle, Technical Report #384, Department of Mathematical Sciences, Clemson University, 1982.
---, Geometric games and their applications, Research Notes in Mathematics No. 82, Pitman Advanced Publishing Program, Boston, London, Melbourne, 1983.
Retrieve articles in Proceedings of the American Mathematical Society with MSC: 90D05
Retrieve articles in all journals with MSC: 90D05