The towers of Hanoi problem with parallel moves
From MaRDI portal
Publication:1209348
DOI10.1016/0020-0190(92)90207-CzbMath0768.68113OpenAlexW2024670581MaRDI QIDQ1209348
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
Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Enumerative combinatorics (05A99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
A note on parallelism for the towers of Hanoi ⋮ The towers of Hanoi problem with cyclic parallel moves ⋮ An optimal algorithm to implement the Hanoi towers with parallel moves ⋮ Parallelism for multipeg towers of Hanoi ⋮ Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach
Cites Work
This page was built for publication: The towers of Hanoi problem with parallel moves