Hey list,
I've toyed with an implementation of a solution to the Tower of Hanoi
problem in Pd. It ended up being too simple once i skipped trying to
use the recursive algorithm that normally is used to solve the
problem. Instead i've used an iterative algorithm that uses a binary
will have a look now, but wikipedia says it takes 561 billion years to
get a solution.
you may never see me again!
___
PD-list@iem.at mailing list
UNSUBSCRIBE and account-management -
http://lists.puredata.info/listinfo/pd-list
On 28/02/2007, at 13.32, hard off wrote:
will have a look now, but wikipedia says it takes 561 billion years to
get a solution.
you may never see me again!
Yes, if you set it up with 64 disks and 1 sec. delay between each
move...
Hope you come back.
Best, Steffen
