thorberg Posted September 25, 2019 Share Posted September 25, 2019 Hi, I'm from KotF (codename Senate Flounder) and I need help understanding the syntax of botroute files, specifically what the numbers of a given line represent. We're attempting something new, and I require this knowledge to press forward. Thanks in advance. Link to comment
Lyo Posted September 25, 2019 Share Posted September 25, 2019 Hi, It seems to be the coordinates of the waypoints of the map.It's better to work on it ingame, more practical and more visual. Some useful functions for a .cfg file or to type in the console : seta developer 1 seta bot_wp_edit 1 bind Q bot_wp_add bind E bot_wp_rem bind R bot_wp_save Link to comment
thorberg Posted September 25, 2019 Author Share Posted September 25, 2019 Making the file in JA is not the issue; I need to extract the coordinates in the file for other purposes and I need to know the breakdown of each of the numbers for it to work. Link to comment
Raz0r Posted September 25, 2019 Share Posted September 25, 2019 https://github.com/JACoders/OpenJK/blob/master/codemp/game/ai_wpnav.c#L2429-L2499 Basically a list of nodes (id, flags, weight and coordinates) and each node lists its neighbouring node's IDs. I think. Haven't looked at an actual .wnt file Link to comment
thorberg Posted September 25, 2019 Author Share Posted September 25, 2019 https://github.com/JACoders/OpenJK/blob/master/codemp/game/ai_wpnav.c#L2429-L2499 Basically a list of nodes (id, flags, weight and coordinates) and each node lists its neighbouring node's IDs. I think. Haven't looked at an actual .wnt file That seems to check (although I don't know what weight would have anything to do with anything) but what about the numbers after that? Sample entry: 17 4194304 0.000000 (-478.067963 100.311096 -7.875000) { 37 38 39 40 41 42 } 32.000000 Link to comment
Raz0r Posted September 27, 2019 Share Posted September 27, 2019 It's the neighbouring node's IDs i.e. the most nearby points. The ID for this node is the first number in the line. "weight" is a term used in graph theory usually to explain the cost of traversing from one node to another (e.g. distance, "difficulty")http://www.mathcs.emory.edu/~cheung/Courses/171/Syllabus/11-Graph/weighted.html The last number in the line appears to be the distance from this node to the next (precomputed) Link to comment
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now