IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v45y2016i4d10.1007_s00182-015-0489-3.html
   My bibliography  Save this article

Building Nim

Author

Listed:
  • Eric Duchêne

    (Université Lyon 1, LIRIS, UMR5205)

  • Matthieu Dufour

    (Université du Québec à Montréal)

  • Silvia Heubach

    (California State University Los Angeles)

  • Urban Larsson

    (Dalhousie University)

Abstract

The game of nim, with its simple rules, its elegant solution and its historical importance is the quintessence of a combinatorial game, which is why it led to so many generalizations and modifications. We present a modification with a new spin: building nim. With given finite numbers of tokens and stacks, this two-player game is played in two stages (thus belonging to the same family of games as e.g. nine-men’s morris): first building, where players alternate to put one token on one of the, initially empty, stacks until all tokens have been used. Then, the players play nim. Of course, because the solution for the game of nim is known, the goal of the player who starts nim play is a placement of the tokens so that the Nim-sum of the stack heights at the end of building is different from 0. This game is trivial if the total number of tokens is odd as the Nim-sum could never be 0, or if both the number of tokens and the number of stacks are even, since a simple mimicking strategy results in a Nim-sum of 0 after each of the second player’s moves. We present the solution for this game for some non-trivial cases and state a general conjecture.

Suggested Citation

  • Eric Duchêne & Matthieu Dufour & Silvia Heubach & Urban Larsson, 2016. "Building Nim," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(4), pages 859-873, November.
    • Handle: RePEc:spr:jogath:v:45:y:2016:i:4:d:10.1007_s00182-015-0489-3
    DOI: 10.1007/s00182-015-0489-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00182-015-0489-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00182-015-0489-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Will Johnson, 2014. "The combinatorial game theory of well-tempered scoring games," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(2), pages 415-438, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ravi Kant Rai & Urban Larsson & Neel Patel, 2021. "Discrete Richman-bidding scoring games," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(3), pages 695-728, September.
    2. Urban Larsson & Richard J. Nowakowski & Carlos P. Santos, 2018. "Games with guaranteed scores and waiting moves," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(2), pages 653-671, May.
    3. Jonathan Chappelon & Urban Larsson & Akihiro Matsuura, 2018. "Two-player Tower of Hanoi," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(2), pages 463-486, May.

    More about this item

    Keywords

    Combinatorial game; Nim;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:45:y:2016:i:4:d:10.1007_s00182-015-0489-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.