Advertisement

A New Heap Game

  • Aviezri S. Fraenkel
  • Dmitri Zusman
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1558)

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.

Keywords

multi-heap games efficient strategy Wythoff game 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E. R. Berlekamp, J. H. Conway and R. K. Guy 1982, Winning Ways (two volumes), Academic Press, London.MATHGoogle Scholar
  2. 2.
    H. S. M. Coxeter 1953, The golden section, phyllotaxis andWythoff’s game, Scripta Math. 19, 135–143.MATHMathSciNetGoogle Scholar
  3. 3.
    A. P. Domoryad 1964, Mathematical Games and Pastimes (translated by H. Moss), Pergamon Press, Oxford.MATHGoogle Scholar
  4. 4.
    A. S. Fraenkel 1982, How to beat your Wythoff games’ opponent on three fronts, Amer. Math. Monthly 89, 353–361.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    A. S. Fraenkel 1996, Scenic trails ascending from sea-level Nim to alpine chess, in: Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, July, 1994, Berkeley, CA (R. J. Nowakowski, ed.), MSRI Publ. Vol. 29, Cambridge University Press, Cambridge, pp. 13–42.Google Scholar
  6. 6.
    A. S. Fraenkel [>1999], Adventures in Games and Computational Complexity, to appear in Graduate Studies in Mathematics, Amer. Math. Soc., Providence, RI.Google Scholar
  7. 7.
    M. Hall 1986, Combinatorial Theory, 2nd edition, Wiley, New York.MATHGoogle Scholar
  8. 8.
    E. H. Moore 1909–1910, A generalization of the game called nim, Ann. of Math. 11 (Ser. 2), 93–94.Google Scholar
  9. 9.
    D. Singmaster 1981, Almost all games are first person games, Eureka 41, 33–37.Google Scholar
  10. 10.
    D. Singmaster 1982, Almost all partizan games are first person and almost all impartial games are maximal, J. Combin. Inform. System Sci. 7, 270–274.MATHMathSciNetGoogle Scholar
  11. 11.
    W. A. Wythoff 1907, A modification of the game of Nim, Nieuw Arch. Wisk. 7, 199–202.Google Scholar
  12. 12.
    A. M. Yaglom and I. M. Yaglom 1967, Challenging Mathematical Problems with Elementary Solutions (translated by J. McCawley, Jr., revised and edited by B. Gordon), Vol. II, Holden-Day, San Francisco.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Aviezri S. Fraenkel
    • 1
  • Dmitri Zusman
    • 1
  1. 1.Department of Applied Mathematics and Computer ScienceThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations