ALL libraries (COBIB.SI union bibliographic/catalogue database)
13.
The Dudeney–Stockmeyer Conjecture
Hinz, Andreas M., 1954- ; Lužar, Borut ; Petr, Ciril
Consider a variant of the famous Tower of Hanoi problem where moves of the discs are allowed along the edges of a connected simple graph ▫$D$▫ whose vertices represent the vertical pegs of the ...puzzle. The task is to transfer a tower of ▫$n \in \mathbb{N}$▫ discs from one peg to another according to the well-known rules of the classical game corresponding to ▫$D \equiv K_3$▫. Apart from its recreational appeal, the problem brings about fascinating integer sequences engendered by the respective minimum number of moves, i.e., the distance in the canonical metric of the state graph ▫$H_n^D$▫. We construct an algorithm which solves the task for all cases but the exceptional instance of the Linear Tower of Hanoi (i.e. where ▫$D$▫ is a path graph) in which the transfer is between the two end vertices of ▫$D$▫. Optimality of this algorithm is claimed in our central conjecture which is supported by large-scale computational explorations.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
