Tower of Hanoi

Tower of Hanoi

The Tower of Hanoi is a puzzle game and problem-solving assessment that involves moving disks from the leftmost rod to the middlemost rod while following specific rules, including only moving one disk at a time, only moving the topmost disk on a rod, and only placing disks on top of larger disks. It was introduced by French mathematician Edouard Lucas in 1889 and is widely known and played.From: The effects of observation in video games: how remote observation influences player experience, motivation, and behaviour [2022], Applied Differential Equations with Boundary Value Problems [2017]

Numerical Methods

View Chapter

Purchase Book

Published in Vladimir A. Dobrushkin, Applied Differential Equations with Boundary Value Problems, 2017

Vladimir A. Dobrushkin

For this sequence of (integer) numbers {hn}n≥0 we can assign an infinite series H(z)=∑hnzn $ H(z) = \mathop \sum \limits_{{}}^{{}} h_{n} z^{n} $ , called the generating function. Find the generating function for the sequence of the Tower of Hanoi. Note: the Tower of Hanoi puzzle was introduced by the French mathematician Edouard Lucas (18421891) in 1889.

The effects of observation in video games: how remote observation influences player experience, motivation, and behaviour

View Article

Journal Information

Published in Behaviour & Information Technology, 2022

Dominic Kao

The Tower of Hanoi is a popular puzzle game that is also widely used as a problem-solving assessment (Kotovsky, Hayes, and Simon 1985) (see Figure 3.) The goal in the game is to move all the disks from the leftmost rod to the middlemost rod, with the following rules: (1) only one disk can be moved at a time, (2) only the topmost disk on a rod can be moved, and (3) disks can only be placed on top of larger disks.

Explore chapters and articles related to this topic

Numerical Methods

The effects of observation in video games: how remote observation influences player experience, motivation, and behaviour