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> <4o5vgr$f2e@tribune.concentric.net> <4o62r7$sjo@laurel.stud.phil.ruu.nl>
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!nntp.coast.net!howland.reston.ans.net!EU.net!Norway.EU.net!nntp.uio.no!ifi.uio.no!news.sics.se!newsfeed.sunet.se!news01.sunet.se!sunic!news99.sunet.se!news.uni-c.dk!imada.ou.dk!breese
From: breese@imada.ou.dk (Bjorn Reese)
Message-ID: <1996Jun2.172616.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:26:16 GMT
Lines: 18
Newsgroups: comp.ai.games

Martijn Faassen wrote:
> 
> It's not heuristic at all, indeed. Like I said, it's probably done
> long before I did it (by Dijkstra), but it's interesting trying to figure
> this out for myself.

I definitely agree. I've also been reinventing this wheel. While
designing the framework for a distributed strategy game, I was trying
to find the shortest path between two servers in a complex web of
servers. So I ended up with a kind of dammed flooding routing, and
ants (although I called them "pathfinder") to record the "road".


-- 
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
