About: Tower of Hanoi   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

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

AttributesValues
rdfs:label
  • Tower of Hanoi
rdfs:comment
  • 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].
sameAs
dbkwik:puzzles/pro...iPageUsesTemplate
abstract
  • 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].
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] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software