Section: New Results

A formal study of the towers of Hanoi

Participant : Laurent Théry.

The towers of Hanoi is a classical example that illustrates the power of recursive programming. Proving that the recursive program solves the problem is elementary but proving that it is a minimal solver is harder. This is even more difficult if we consider the general problem that considers arbitrary starting and final positions. We present the formalisation of this problem in the Mathematical Component Library [22].