[MUD-Dev] Room Generation

[Travis Casey]

On Saturday, January 20, 2001, Ola Fosheim Grøstad wrote:

> Patrick Dughi wrote:

>> 1. Cat's Cradle
 
>> Determine the shortest path to each accessable node from each node.
>> Identify the ((# of nodes/20) + 1) nodes with the largest shortest
>> (via something like BFS) paths (not necessarily to eachother).

> What is BFS?

Breadth-First Search.  I.e., check every route of one "step" from your
current location, and see if any of them take you to the destination.
If one does, stop.  Otherwise, repeat with two steps, three steps,
etc., until you find a route.  This is guaranteed to give you a route
that is one of the shortest possible ones.

--
       |\      _,,,---,,_    Travis S. Casey  <efindel at earthlink.net>
 ZZzz  /,`.-'`'    -.  ;-;;,_   No one agrees with me.  Not even me.
      |,4-  ) )-,_..;\ (  `'-'
     '---''(_/--'  `-'\_)      


_______________________________________________
MUD-Dev mailing list
MUD-Dev at kanga.nu
https://www.kanga.nu/lists/listinfo/mud-dev