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: <2330@uw-beaver>
Date: Tue, 27-Nov-84 01:55:10 EST
Article-I.D.: uw-beave.2330
Posted: Tue Nov 27 01:55:10 1984
Date-Received: Wed, 28-Nov-84 03:52:39 EST
Sender: root@uw-beave
Organization: U of Washington Computer Science
Lines: 11

From: Tom Garvey <Garvey@SRI-AI.ARPA>
Gee, a DA that solves the Tower of Hanoi problem for 64 disks would be
fairly impressive.  As I recall, the number of "disk swaps" required
to solve the Tower of Hanoi for n disks is 2^n-1.  This comes out to
about (rounding off) 8x10^18 -- with a 7.8 MHz clock, it should take
about ... years (left as an exercise for the reader).  Also, isn't the
world supposed to come to an end when the problem is completed?

Cheers,
Tom
-------