Torre de Hanói

Synopsis: This experiment is not a game known as Towers of Hanoi, which is built from 3-pin and some discs. It has very simple rules: the discs that initially form a tower in the pin, in descending order of size, must be transferred to the latter, moving only one disk at a time and never putting a larger disk on a smaller . In this experiment, we first think of a strategy to solve this game using the fewest possible moves. Then we will try to find the algebraic relationship that provides the smallest possible number of moves in the number of disks in the Tower.
Source: Unicamp - M3, Mathematics Multimedia.
URL: http://m3.ime.unicamp.br/recursos/1361