An optimal algorithm for Reve's puzzle

An optimal algorithm for Reve's puzzle

This paper starts by showing that some recently published algorithms for Reve's puzzle are not optimal. Reve's puzzle is a generalization of the standard Towers of Hanoi whereby the number of pegs is extended from 3 to k ⩾ 2. A simple and elegant recursive algorithm for solving Reve's...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information sciences 1988, Vol.45 (1), p.39-49
1. Verfasser: Er, M.C.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper starts by showing that some recently published algorithms for Reve's puzzle are not optimal. Reve's puzzle is a generalization of the standard Towers of Hanoi whereby the number of pegs is extended from 3 to k ⩾ 2. A simple and elegant recursive algorithm for solving Reve's puzzle is presented. Its optimality is assured by an algorithm for optimally splitting a tower of n discs into two subtowers. The theoretical basis for doing so is also discussed.
ISSN:0020-0255
1872-6291
DOI:10.1016/0020-0255(88)90007-2