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.
Recommendations
Development of a Jenga game manipulator having multi-articulated fingers
HRI '12: Proceedings of the seventh annual ACM/IEEE international conference on Human-Robot InteractionThis paper describes current status of our effort to develop a robot system that can play Jenga game against human players. Unlike most of the previous Jenga robots that use grippers, this robot is equipped with a hand with two multiarticulated fingers ...
Robot jenga: autonomous and strategic block extraction
IROS'09: Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systemsThis paper describes our successful implementation of a robot that autonomously and strategically removes multiple blocks from an unstable Jenga tower. We present an integrated strategy for perception, planning and control that achieves repeatable ...
The interplay between immersion and appeal in video games
A 2í 2 study on immersion and appeal of video games is presented.Immersion and appeal are found to be highly related.Immersion is found to be unaffected by playing experience.Appeal is found to be affected both by game played and playing experience. ...
Comments