Path: utzoo!attcan!utgpu!cs.utexas.edu!samsung!sdd.hp.com!hplabs!hplabsz!sartin
From: sartin@hplabsz.HPL.HP.COM (Rob Sartin)
Newsgroups: alt.sources.d
Subject: Re: Maze generation
Message-ID: <6383@hplabsz.HPL.HP.COM>
Date: 18 Dec 90 17:34:33 GMT
References: <1215@syacus.acus.oz> <1990Dec13.190759.9297@craycos.com> <1990Dec14.001604.20990@informix.com> <1990Dec17.142513@avahi.inria.fr> <A=J^{4+@rpi.edu>
Reply-To: sartin@cup.hp.com (Rob Sartin)
Organization: Hewlett-Packard, Open Systems Software Division
Lines: 7
Summary:
Expires:
Sender:
Followup-To:

Actually, most of you already have a good program for maze solution (as
opposed to generation), it's called pathalias.  Just enter all the rooms
as having links of cost 1 to the rooms they connect to and then run
pathalias with the "entrance" node.  Voila, you get a minimum length
path to every room.  It'll solve non-planar mazes, too.

Rob