OpenLink Software

Usage stats on Tower of Hanoi

 Permalink

an Entity in Data Space: 134.155.108.49:8890

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].

Source Graphs
Referenced by Graphs
Direct coreferences
Indirect coreferences
Graph IRICount
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] This material is Open Knowledge Creative Commons License Valid XHTML + RDFa
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Copyright © 2009-2012 OpenLink Software