The Tower of Hanoi is a mathematical game or puzzle.
It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
- Only one disk can be moved at a time.
- Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
Skich utilise des cookies et des technologies similaires pour fournir, améliorer, sécuriser et analyser ses services. En cliquant sur « Tout accepter », vous acceptez de nous permettre d'utiliser nos propres cookies et ceux de tiers conformément à notre Politique de cookies.
