Counter examples to adjudicating a towers of hanoi contest

DOI10.1080/00207168708803561zbMath0656.68073OpenAlexW2028653032MaRDI QIDQ3804210

M. C. Er

Publication date: 1987

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168708803561

zbMATH Keywords

representationTowers of Hanoistate-space graphadjudicating

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

A statistical analysis of the towers of hanoi problem ⋮ Shortest paths between regular states of the Tower of Hanoi

Cites Work

• The Generalized Colour Towers of Hanoi: An Iterative Algorithm
• Adjudicating a towers of hanoi contest†
• A Representation Approach to the Tower of Hanoi Problem

This page was built for publication: Counter examples to adjudicating a towers of hanoi contest