Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!news.mathworks.com!tank.news.pipex.net!pipex!usenet.eel.ufl.edu!warwick!bsmail!zeus!biigb
From: biigb@zeus.bris.ac.uk (IG. Badcoe)
Subject: Re: Movement Algorithm
Message-ID: <DpDy9K.DnJ@uns.bris.ac.uk>
Sender: usenet@uns.bris.ac.uk (Usenet news owner)
Nntp-Posting-Host: zeus.bris.ac.uk
Organization: University of Bristol, England
X-Newsreader: TIN [version 1.2 PL2]
References: <03-31-1996.669@wwonline.com> <4jutbc$24d@cesium.megatek.com>
Distribution: inet
Date: Fri, 5 Apr 1996 10:53:44 GMT
Lines: 23

Hi,
	Handle movement between rooms differently from movement within rooms.
For between rooms just keep a note of which rooms are in contact and where
the connections are then you can use a 'finite diffusion' method (or a
brute force search if thewre are few enough rooms) to calculate the series
of rooms through which the monster must pass.

	We've discussed this in great detail on this group in the past.
Look in the FAQ and consult the archives.

	Badders












