The towers of Hanoi problem with parallel moves

DOI10.1016/0020-0190(92)90207-CzbMATH Open0768.68113OpenAlexW2024670581MaRDI QIDQ1209348FDOQ1209348

Authors: Jer-Shyan Wu, Rong-Jaye Chen 

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90207-c

zbMATH Keywords

optimal algorithmtowers of Hanoi

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)

Cites Work

• The cyclic towers of Hanoi
• The Towers of Hanoi Problem
• The Towers of Hanoi rainbow problem: Coloring the rings
• Discussion and correspondence: A note on the Towers of Hanoi problem

Cited In (5)

• An optimal algorithm to implement the Hanoi towers with parallel moves
• A note on parallelism for the towers of Hanoi
• Parallelism for multipeg towers of Hanoi
• Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach
• The towers of Hanoi problem with cyclic parallel moves

This page was built for publication: The towers of Hanoi problem with parallel moves

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