Towers of Hanoi -- where programming techniques blend

MaRDI QIDQ3631213zbMATH OpenFDO

Authors Zoltán Kátai, Lehel István Kovács

Publication date 5 June 2009

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• Bounded Hanoi
• scientific article; zbMATH DE number 17050
• The towers of Antwerpen problem
• The Solution to a Hanoi-ing Little Problem
• A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc

Cited in

(2)

• Polynomial fill-in puzzles or how to make sense of the cook-Levin theorem
• scientific article; zbMATH DE number 17050 (Why is no real title available?)

This page was built for publication: Towers of Hanoi -- where programming techniques blend

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