Quote:
Originally Posted by dballs442
thanks for your reply.
however i am not new to waypointing. i understand your concern but this isnt the case i dont believe.
waypoint 144 is just an example. it happened in other places in the map where the waypoint is in the midst of others. i try deleting the waypoint and creating a new one to just be zapped to another place in the map when hitting "check". all say that the path to waypoint nr. 0 is broken. but again waypoint 0 doesnt exsist anymore.
waypoint 144 is in the middle of 2 waypoints along a bridge with both in and out going paths (yellow).
|
Okay, if waypoint No.144 is connected correctly (i mean there is an IN and OUT connection there), then the problem is not in waypoint No.144, but probably in other waypoint around it. Looks like my sentence is too confusing for you (and also for myself!
). I want to tell directly the problem to you but I can't, caused by my poor English. So let me tell you first about how waypoints being checked, so you can understand the problem.
Oh yeah, about the waypoint No.0 deletion, if waypoint No.X is deleted, then all of waypoint number above X is decreased by 1. So in this case waypoint No.1 is become No.0! So (the new) waypoint No.0 is still there!
Let's continue. If (for example) we want to waypoint a map that just a long empty corridor, so it's only need 6 waypoints which placed "linearly", like this:
Code:
O = Waypoint
<--> = Two-way connection
---> = One-way connection
O <-----> O ------> O <-----> O <-----> O <-----> O
No. Index: 0 1 5 4 3 2
Please note that the waypoint number from left to right is 0, 1,
5, 4, 3, 2. and there is only
ONE WAY connection between 1 and 5 (so bots can go from 1 to 5 but not vice versa).
This is how waypoint being checked, first it will check waypoint No.0, can bots from there go to waypoint No.1? Yes, they can, because there is a connection. And it will do the same check for waypoint No.2, No.3, No.4 and No.5 sequentially. And of course all of them pass the check, because there is some path (path here means a group of connections linked together. Ex: From 0 to 4, the path is 0-1-5-4, and path in this case is only one-way) to get there. It will also check for waypoint No.1, same as before, it will check if path to No.0,2,3,4,5 is exist. All of them will also pass the check (you can try to proof it by yourself)
And here comes the problem, when the engine check waypoint No.2 (remember, waypoint checked sequentially), if there is exist a path to No.0. Sadly, it found nothing and will zap us to waypoint No.2 and write "
Path broken from waypoint No.2 to waypoint No.0". And then we check manually if there is something wrong with waypoint No.2. But there is nothing wrong there, there IS a two-way connection to No.3... But actually the problem is not there. Can you understand the problem now? I'm sure you can! If you don't understand some of my explanation, please ask. So, good luck!