Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!torn!nott!cunews!freenet.carleton.ca!FreeNet.Carleton.CA!aq859
From: aq859@FreeNet.Carleton.CA (J. C. Murray)
Subject: Towers of Hanoi
Message-ID: <D1Ho1n.n16@freenet.carleton.ca>
Sender: aq859@freenet.carleton.ca (J. C. Murray)
Organization: The National Capital FreeNet, Ottawa, Ontario, Canada
Date: Tue, 27 Dec 1994 21:36:59 GMT
Lines: 19

Hello,

Has anyone tried to solve the Towers of Hanoi with GA?

I would be interested to see how effective GA can be
at problems which are inherently recursive.

I suspect that they are ideally suited to the problem,
since biological organisms show the same recursive 
properties (leaves, trees, etc.).  

I suppose that the correct approach might be to look
at some work on fractal image compression, then imagine how
this could be represented in a fixed-length gene.

Any ideas?  Please email.

Regards,
J.C. Murray
