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].
| Graph IRI | Count |
|---|---|
| http://dbkwik.webdatacommons.org | 7 |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
