Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 UW 5/3/83; site uw-beaver
Path: utzoo!watmath!clyde!burl!ulysses!mhuxj!houxm!vax135!cornell!uw-beaver!info-mac
From: info-mac@uw-beaver (info-mac)
Newsgroups: fa.info-mac
Subject: Re: more desk accessories
Message-ID: <2336@uw-beaver>
Date: Tue, 27-Nov-84 04:03:18 EST
Article-I.D.: uw-beave.2336
Posted: Tue Nov 27 04:03:18 1984
Date-Received: Wed, 28-Nov-84 03:50:45 EST
Sender: root@uw-beave
Organization: U of Washington Computer Science
Lines: 5

From: Gustavo Fernandez <FERNANDEZ@SU-SCORE.ARPA>
I never said it would COMPLETE the tower of hanoi for 64 disks. The algorithm, however, will solve for N disks in linear (stack) space so it will at least
attempt a completion.
			Gus
-------