During the annual Hour of Code, the students are presented with the problem called Towers of Hanoi. It’s a famous problem with applications in computer science, mathematics, and everyday life.
Towers of Hanoi was proposed in 1883 by Edouard Lucas. The problem is to move a disk from the first peg to the last peg respecting the following rules: you can only move one disk at a time and the disks must always be in ascending order (the disk on top is always smaller than the one it sits on).