Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!tut.cis.ohio-state.edu!pacific.mps.ohio-state.edu!zaphod.mps.ohio-state.edu!uakari!caesar.cs.montana.edu!milton!uw-beaver!Teknowledge.COM!unix!hplabs!hp-ses!hpcuhb!hpcllla!hpclisp!hpcljws!jws
From: jws@hpcljws.HP.COM (John Stafford)
Newsgroups: comp.sys.handhelds
Subject: Re: Various programs
Message-ID: <17050003@hpcljws.HP.COM>
Date: 23 Feb 90 20:46:05 GMT
References: <16@iconsys.icon.com>
Organization: Hewlett-Packard Calif. Language Lab
Lines: 5

Well I haven't any real data to back this up, but "towers" is probably
the Towers of Hanoi (or whatever) program, I suspect f = from pole, a =
auxiliary (temp) pole, t = to pole, and n = the number of disks.  Try f
= 1, a = 2, t = 3, and n something <=8 (I believe the puzzle takes
(2**n)-1 moves).