Jenga

7Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Zwick, U. (2002). Jenga. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 06-08-January-2002, pp. 243–246). Association for Computing Machinery. https://doi.org/10.1145/3140659.3080214

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free