Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!feed.news.qwest.net!news.uswest.net.POSTED!cj
From: c...@bird.hoax.qwest.net ()
Newsgroups: comp.lang.lisp
Subject: Re: find path in a labyrinth
References: <ak7h1k$7ca$1@lacerta.tiscalinet.it>
Message-ID: <slrnaml88n.mu5.cj@bird.hoax.qwest.net>
User-Agent: slrn/0.9.6.4 (Linux)
Lines: 23
Date: Mon, 26 Aug 2002 21:43:50 GMT
NNTP-Posting-Host: 63.231.71.205
X-Trace: news.uswest.net 1030398230 63.231.71.205 (Mon, 26 Aug 2002 16:43:50 CDT)
NNTP-Posting-Date: Mon, 26 Aug 2002 16:43:50 CDT

On Sat, 24 Aug 2002 10:44:40 +0200, CheTeFreGa <doub...@tiscali.it> wrote:
>hi,
>    i want to develop a lisp pure recursive program (no iteration and no
>assignment) to find the shortest path in a labyrinth! someone as same idea?

you should hope that posting your assignment here isn't a violation of your 
schools' cheating policy, and further hope that your professor is not reading
this ng. 

one way to solve this problem, but i don't recall if this guarantees shortest
path, is A* search with manhatten distance as your distance heuristic. i've
seen this approach to the 15-puzzle w/ no iteration, no assignment and fully
recursive.


-- 
===============================================================================
Christopher Jon Miller                        Drink and dance and laugh and lie
Parallel Systems Engineer                    Love, the reeling midnight through
                                                     For tomorrow we shall die!
                                                      (But, alas, we never do.)
                                      -- Dorothy Parker, "The Flaw in Paganism"
===============================================================================