scientific article; zbMATH DE number 4007723

zbMATH Open0621.68029MaRDI QIDQ3758241FDOQ3758241

Authors: Colin Gerety, Paul Cull 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• The complexity of an optimal algorithm for the generalized tower of hanoi problem
• The complexity of the generalised cyclic Towers of Hanoi problem
• Towers of Hanoi and Analysis of Algorithms
• Algorithm and time complexity analysis of six-pole Hanoi tower problem
• On the average-case complexity of the Bottleneck Tower of Hanoi problem
• Short Notes: A Fast Algorithm for the Towers of Hanoi Problem
• Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem
• scientific article; zbMATH DE number 501074
• Hamiltonianicity of the towers of Hanoi problem
• The Generalized Towers of Hanoi Problem

zbMATH Keywords

Towers of Hanoi

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (6)

• Title not available (Why is that?)
• Towers of Hanoi and Analysis of Algorithms
• Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time
• Algorithm and time complexity analysis of six-pole Hanoi tower problem
• The complexity of the generalised cyclic Towers of Hanoi problem
• Tours de Hanoï et automates

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758241)