I was looking through the find_first_step function, which track is based
off of, which determines the direction a player must next go to find
someone. Thinking this over, would it be possible to determine the entire
set of steps needed to a player, and then find that for every person in a
zone, and then compare how many there were to find which player is closest?
Is this possible to do, in C code, or would it cause too much processing to
have every MOB doing this at one time? Thanks for any help! :)
[ Tadrith Skandrakae, Implementor of Dreamscape ]
[ - telnet://mud.dreamscape.org:1234/ - ]
["I lay my dreams before your feet; ]
[ tread softly, for you tread on my dreams. ]
+------------------------------------------------------------+
| Ensure that you have read the CircleMUD Mailing List FAQ: |
| http://democracy.queensu.ca/~fletcher/Circle/list-faq.html |
+------------------------------------------------------------+
This archive was generated by hypermail 2b30 : 12/15/00 PST