Note on the Towers of Hanoi problem.
This paper contains some simple observations for the Tower of Hanoi game with \(n\) circular rings and three pegs, e.g. which ring is deplaced at the \(k\)-th move or how often is ring \(r\) transferred during the first \(k\) moves. Reviewer's remark: The identical paper (with some lines added at the end) appeared also in [\textit{I. Lavallée}, Rev. Roum. Math. Pures Appl. 30, 433--438 (1985; Zbl 0577.05010)].
scientific article; zbMATH DE number 3885913