| 11-18-2002, 05:44 PM | #1 |
Guest | I know there must be an easier way to do this. I am trying to make a circular maze (meaning it has no end) where all rooms of the maze are connected to each other in a circular fashion, but the connections are random (this would be a like a complete bidirectional graph). Since I am using WE, it would be even more difficult to create the maze from stratch, so I made a system of "Caverns" that use warp points from each room. There are 10 rooms, and the number of warps in each room range from 2-4. Warps are bidirectional, so that means if you backtrack you will go back to the same room you came from. Currently I am using a very complex set of two loops (looping through rooms and warps) which even have some loops instead of them to check to make sure the warp link is valid - IE, if its not linking to the same room and the warp is linking to another valid warp (where valid means the warp isn't NULL and isn't already linked to another warp). As well, while its interating through warps in rooms, it skips over NULL warps and warps that are already linked. Any ideas? |
| 11-18-2002, 07:12 PM | #2 |
What's the question? =O) |
