Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!psinntp!psinntp!psinntp!psinntp!news.NetVision.net.il!telgate.telrad.co.il!mofet.elex.co.il!tx1.elex.co.il!news
From: "gil" <hakim@tx1.elex.co.il>
Subject: Re: Movement Algorithm
In-Reply-To: Your message of Sun, 31 Mar 96 14:47:02 -0600.<03-31-1996.669@wwonline.com>
X-Nntp-Posting-Host: tprjpc41
Message-ID: <Dp80nJ.9MK@tx1.elex.co.il>
To:  Annamma Alexander <aalexand@wwonline.com> 
Encoding:  7 TEXT , 4 TEXT 
Sender: news@tx1.elex.co.il (NEWS SERVER TX1)
Organization: Telrad Ltd.
Date: Tue, 2 Apr 1996 16:58:24 GMT
Lines: 12

You might want to use the MoveCloseToPlayer() function if monster and player
are in the same room; if player and monster are in two different rooms, look
for a path in terms of rooms (can be a tree) them move your monster from
room to room, and when your monster is in same room as player's use your
MoClToPlayer() function. 
Cheers.
Gil

Orson Scott Card, Robert Sheckley, Robert Heinlein,Racine,Mendel Mann,Ernst Lubitch, thanks a lot.



