Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!cs.utexas.edu!usc!snorkelwacker.mit.edu!bloom-beacon!eru!hagbard!sunic!mcsun!cernvax!chx400!sicsun!disuns2!disun17!diderich
From: diderich@disun17.epfl.ch (Claude Diderich)
Newsgroups: comp.theory
Subject: Non recursive "Towers of Hanoi"
Keywords: Towers of Hanoi, Recursivity, Storage
Message-ID: <1197@disuns2.epfl.ch>
Date: 26 Nov 90 10:36:57 GMT
Sender: news@disuns2.epfl.ch
Reply-To: diderich@eldi.epfl.ch (Claude Diderich)
Organization: Ecole Polytechnique Federale de Lausanne
Lines: 24

Dear reader,

I would like to know if anyone knows of an algorithm for solving the "Tower of
Hanoi" problem using the following constraints:

1. The algorithm is deterministic (no backtracking, etc...)
2. The algorithm is iterative (no recursion)
3. The algorithm uses at most O(1) extra storage in additon to the
storage      required to modelize the three piles.
4. The number of iterations can be determined a priori. It must be a
function of n, the number of disks.
5. The algorithm may be non-polynomial.

Send replies to "diderich@eldi.epfl.ch" or post them to the net. Thanks
in adavnce for youe numerous replies.

Claude G.Diderich

-------------------------------------------------------------------------------
Claude G.Diderich                  Internet: diderich@eldi.epfl.ch
30, Avenue S.Reymondin             Chadnet:  ELDI::DIDERICH
CH-1009 Pully                      Hepnet:   20550::DIDERICH (PSICLU::DIDERICH)
Switzerland - Europe
-------------------------------------------------------------------------------