Proof Pearl : Playing with the Tower of Hanoi Formally
Preuve : Jouer avec les tours d'Hanoï formellement
Abstract
The Tower of Hanoi is a typical example that is used in computer science courses to illustrate all the power of recursion. In this paper, we show that it is also a very nice example for inductive proofs and formal verification. We present some non-trivial results that have been formalised in the {Coq} proof assistant.