La quatrième tour de Hanoï.

In the four-peg variant of the Towers of Hanoi game, it is well known that N disks can be transferred from a column to another in 2∇0 + 2∇1 +... + 2 ∇(N - 1) moves, where Vn denotes the largest integer p such that p(p + 1)/2 ≤ n, and it was conjectured that this number of moves was the minimum possible. We shall see, in this article, that is indeed the case. [ABSTRACT FROM AUTHOR]