go looking in you local computer book store (or barnse and nobles) for
a book on graph theory, or an algorythms book. Most of the algorithms
you find will be marking rooms, because how else will you be able to
tell when you are looping. (tracking through midgaard?) A BFS like
the one used it probably going to give some of the best results and it
won't really be worth the code time to improve. Good luck.
--Angus
______________________________ Reply Separator _________________________________
Subject: non-recursive tracking algorithm (that works)
Author: INTERNET:CIRCLE@post.queensu.ca at CSERVE
Date: 10/13/97 2:05 PM
CODE:
In Circle3 there is a graph.c file which contains the tracking algorithm for the
skill track. Although this algorithm may have at one time worked okay, after
ext ensive changes to rooms, wilderness, etc., it doen't work now. I never
liked it anyway. It is poorly commented and clumsily designed.
Does anyone have a decent idea as to how to do this the right way. For example,
one that doesn't mark the rooms as it goes. One that doesn't use an expensive
re cursion. One that can be called a thousand times per minute without inducing
serv er lag.
All I am looking for is a desgn, a theory, I don't need the actual code.
Thanks to any that reply.
--Sean (Xin)
+------------------------------------------------------------+
| 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/08/00 PST