The smallest number of moves in which the puzzle can be completed, for n discs, is 2n – 1 Go to the techniques page → Image:Stub.png This article is a stub. You can help the My English Wiki by [ expanding it].
| Identifier (URI) | Rank |
|---|---|
| dbkwik:resource/IvLxBF45D-pTunPp_CmW-A== | 5.88129e-14 |
| dbr:Tower_of_Hanoi | 5.88129e-14 |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
