Xref: utzoo comp.ai:6556 comp.sys.amiga.tech:11102
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!pyrdc!wperkins!wmp
From: wmp@wperkins.UUCP (William M. Perkins)
Newsgroups: comp.ai,comp.sys.amiga.tech
Subject: Lisp question
Keywords: Lisp Xlisp
Message-ID: <0981.AA0981@wperkins.UUCP>
Date: 9 Apr 90 22:46:41 GMT
Followup-To: comp.sys.amiga
Distribution: na
Lines: 30

We were talking about this AI problem at work the other day and I was
wondering if any one out there could suggest a way to solve it in xlisp 
or common lisp.  Any help would be appreciated.

	Road Map: Read a network of roads from a file with a structure
	like - (<pt-name> <x-coordinate> <y-coordinate>) for the locations
	of the points on the map and (<pt-name> <pt-name> <pt-name>) for 
	the list of points that make up a road.

	The program reads this in and asks for a starting and ending point
	and it returns the shortest route connecting the points with
	respect to the known roadways.  The program must use the A* algorithm
	as the search whatever that is.  Please explain.

	These are lists in the file.

        (<pt-name> <x-coordinate> <y-coordinate>) for the locations of the 
	points on the map and 

	(<pt-name> <pt-name> <pt-name>) for the list of points that make 
	up a road.

Please respond by email.  Comp.ai is not carried by my newsfeed.

        Bill

---
William M. Perkins                Of course we run UUCP on an Amiga!
The Greenwood                             wmp@wperkins.UUCP
+1 703 590 0207                      ...!uunet!pyrdc!wperkins!wmp