X-Mailer: Mozilla 2.0 (X11; I; SunOS 5.5 sun4m)
MIME-Version: 1.0
Subject: Re: More shortest pathing
References: <4o5kom$sf3@laurel.stud.phil.ruu.nl> <4oe3i5$mq@reuter.cse.ogi.edu>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!godot.cc.duq.edu!newsgate.duke.edu!news.mathworks.com!news.kei.com!newsfeed.internetmci.com!news.corpcomm.net!funny.bahnhof.se!newsfeed.tip.net!cph-2.news.DK.net!dkuug!dknet!cph-1.news.DK.net!dkuug!dknet!news1.tele.dk!medura.tele.dk!news.uni-c.dk!imada.ou.dk!breese
From: breese@imada.ou.dk (Bjorn Reese)
Message-ID: <1996Jun2.171049.9232@imada.ou.dk>
Sender: news@imada.ou.dk
Nntp-Posting-Host: gounod.imada.ou.dk
Organization: Dept. of Math. & Computer Science, Odense University, Denmark
Date: Sun, 2 Jun 1996 17:10:49 GMT
Lines: 16
Newsgroups: comp.ai.games

Richard Wesson wrote:
> 
> Keep track of the time tick and every time an ant steps on a new square,
> 'stamp' that square with the current time tick.  When one ant reaches
> the destination, you can find the shortest path back to the start by
> starting at the end and always going to the square with the smallest
> time stamp.

This is (almost) the "Wavefront expansion" described in "Robot Motion
Planning" by Jean-Clauede Latombe (ISBN: 0-7923-9129-2)

-- 
Bjorn Reese                      Email: breese@imada.ou.dk
Odense University, Denmark       URL:   http://www.imada.ou.dk/~breese

"It's getting late in the game to show any pride or shame" - Marillion
