Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!news.mathworks.com!tank.news.pipex.net!pipex!peer-news.britain.eu.net!newsfeed.ed.ac.uk!dcs.ed.ac.uk!jura.dcs.ed.ac.uk!iic
From: iic@dcs.ed.ac.uk (Ian Clarke)
Subject: Re: Maze Solving Algorithms
X-Nntp-Posting-Host: jura.dcs.ed.ac.uk
Message-ID: <DKxBoH.9r5.0.staffin.dcs.ed.ac.uk@dcs.ed.ac.uk>
To: lsl@doc.ic.ac.uk (Ledda Stephanie Lopez)
Sender: iic@jura.dcs.ed.ac.uk (Ian Clarke)
Organization: Department of Computer Science, University of Edinburgh
X-Newsreader: xrn 8.00
References:  <4crvf3$d60@oak41.doc.ic.ac.uk>
Date: Tue, 9 Jan 1996 17:09:51 GMT
Lines: 22

In article <4crvf3$d60@oak41.doc.ic.ac.uk>, lsl@doc.ic.ac.uk (Ledda Stephanie Lopez) writes:
> 
> Hi,
> 
> Are there any GA methods for solving Mazes ?
> 
> researching into Maze Solving Algorithms, 
> 					Ledda.
> 
> lsl@doc.ic.ac.uk
> 

I saw something about maze solving in some book a while ago.  Several
unidred creatures were given random programs (probably in a specially
designed language) and were set the task of navagating a maze.  They
evolved tatics specific to their own maze but I don't think they
developed any general maze solving strategies.

-- 
|IAN CLARKE        I.Clarke@sms.ed.ac.uk "They couldn't hit an elephant|
|                  iic@dcs.ed.ac.uk      at this dist.."  - Last words |
|I.Clarke@ed.ac.uk ianc@aisb.ed.ac.uk    of General M Howard, 1918     |
