skip to main content
10.5555/545381.545412acmconferencesArticle/Chapter ViewAbstractPublication PagessodaConference Proceedingsconference-collections
Article

Jenga

Published:06 January 2002Publication History

ABSTRACT

Jenga is a popular block game played by two players. Each player in her turn has to remove a block from a stack, without toppling the stack, and then add it the top of the stack. We analyze the game mathematically and describe the optimal strategies of both players. We show that 'physics', that seems to play a dominant role in this game, does not really add much to the complexity of the (idealized) game, and that Jenga is, in fact, a Nim-like game. In particular, we show that a game that starts with n full layers of blocks is a win for the first player if and only if n = 2, or n ≡ 1, 2 (mod 3) and n ≥ 4. We also suggest some several natural extensions of the game.

References

References are not available

  1. Jenga

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
      January 2002
      1018 pages
      ISBN:089871513X

      Publisher

      Society for Industrial and Applied Mathematics

      United States

      Publication History

      • Published: 6 January 2002

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate411of1,322submissions,31%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader