1 #include "navigation.qh"
6 #include "waypoints.qh"
8 #include <common/t_items.qh>
10 #include <common/items/_mod.qh>
12 #include <common/constants.qh>
13 #include <common/net_linked.qh>
14 #include <common/triggers/trigger/jumppads.qh>
18 void navigation_dynamicgoal_init(entity this, bool initially_static)
20 this.navigation_dynamicgoal = true;
21 this.bot_basewaypoint = this.nearestwaypoint;
23 this.nearestwaypointtimeout = -1;
25 this.nearestwaypointtimeout = time;
28 void navigation_dynamicgoal_set(entity this)
30 this.nearestwaypointtimeout = time;
33 void navigation_dynamicgoal_unset(entity this)
35 if(this.bot_basewaypoint)
36 this.nearestwaypoint = this.bot_basewaypoint;
37 this.nearestwaypointtimeout = -1;
40 bool navigation_checkladders(entity e, vector org, vector m1, vector m2, vector end, vector end2, int movemode)
42 IL_EACH(g_ladders, it.classname == "func_ladder",
45 if(boxesoverlap(org + m1 + '-1 -1 -1', org + m2 + '1 1 1', it.absmin, it.absmax))
46 if(boxesoverlap(end, end2, it.absmin + (m1 - eZ * m1.z - '1 1 0'), it.absmax + (m2 - eZ * m2.z + '1 1 0')))
49 top.z = it.absmax.z + (PL_MAX_CONST.z - PL_MIN_CONST.z);
50 tracebox(org, m1, m2, top, movemode, e);
51 if(trace_fraction == 1)
58 #define IN_WATER(pos) (cont = pointcontents(pos), (cont == CONTENT_WATER || cont == CONTENT_LAVA || cont == CONTENT_SLIME))
59 #define SUBMERGED(pos) IN_WATER(pos + autocvar_sv_player_viewoffset)
60 #define WATERFEET(pos) IN_WATER(pos + eZ * (m1.z + 1))
62 #define RESURFACE(org) MACRO_BEGIN { \
63 while(org.z + 4 < end2.z) { \
64 if(!WATERFEET(org + eZ * 4)) \
69 // rough simulation of walking from one point to another to test if a path
70 // can be traveled, used for waypoint linking and havocbot
71 // if end_height is > 0 destination is any point in the vertical segment [end, end + end_height * eZ]
72 bool tracewalk(entity e, vector start, vector m1, vector m2, vector end, float end_height, float movemode)
74 if(autocvar_bot_debug_tracewalk)
81 vector dir = end - start;
83 float dist = vlen(dir);
86 bool ignorehazards = false;
87 bool swimming = false;
88 bool swimming_outwater = false;
91 // Analyze starting point
92 traceline(start, start, MOVE_NORMAL, e);
93 if (trace_dpstartcontents & (DPCONTENTS_SLIME | DPCONTENTS_LAVA))
97 traceline( start, start + '0 0 -65536', MOVE_NORMAL, e);
98 if (trace_dpstartcontents & (DPCONTENTS_SLIME | DPCONTENTS_LAVA))
101 tracebox(start, m1, m2, start, MOVE_NOMONSTERS, e);
102 if (trace_startsolid)
105 if(autocvar_bot_debug_tracewalk)
106 debugnodestatus(start, DEBUG_NODE_FAIL);
108 //print("tracewalk: ", vtos(start), " is a bad start\n");
114 end2.z += end_height;
118 if (boxesoverlap(end, end2, org + '-1 -1 -1', org + '1 1 1'))
121 if(autocvar_bot_debug_tracewalk)
122 debugnodestatus(org, DEBUG_NODE_SUCCESS);
124 //print("tracewalk: ", vtos(start), " can reach ", vtos(end), "\n");
127 if(autocvar_bot_debug_tracewalk)
133 traceline(org, org, MOVE_NORMAL, e);
137 if (trace_dpstartcontents & (DPCONTENTS_SLIME | DPCONTENTS_LAVA))
139 // hazards blocking path
140 if(autocvar_bot_debug_tracewalk)
141 debugnodestatus(org, DEBUG_NODE_FAIL);
143 //print("tracewalk: ", vtos(start), " hits a hazard when trying to reach ", vtos(end), "\n");
147 if ((trace_dpstartcontents & DPCONTENTS_LIQUIDSMASK) || swimming)
149 vector water_end = end;
150 water_end.z = bound(end.z, org.z, end2.z);
152 if(swimming_outwater)
161 water_dir = normalize(water_end - org);
162 vector ang = vectoangles(water_dir);
163 float c = cos(ang.x * DEG2RAD);
164 if (stepdist * c > dist)
166 dist -= stepdist * c;
168 vector move = org + water_dir * stepdist;
170 tracebox(org, m1, m2, move, movemode, e);
171 if (trace_fraction < 1) // cant swim in the current direction
174 tracebox(org + stepheightvec, m1, m2, move, movemode, e);
176 tracebox(org + stepheightvec, m1, m2, move + stepheightvec, movemode, e);
177 if (trace_startsolid)
179 if(autocvar_bot_debug_tracewalk)
180 debugnodestatus(org, DEBUG_NODE_FAIL);
183 //print("tracewalk: ", vtos(start), " failed under water\n");
186 if (trace_fraction < 1) // cant step-swim in the current direction
188 if(autocvar_bot_debug_tracewalk)
189 debugnodestatus(org, DEBUG_NODE_WARNING);
194 if(autocvar_bot_debug_tracewalk)
198 move = org + dir * stepdist;
200 tracebox(org + stepheightvec, m1, m2, move + stepheightvec, movemode, e);
203 if (trace_fraction < 1 || trace_startsolid) // can't jump obstacle out of water
205 vector v = trace_endpos - stepheightvec + jumpheight_vec;
206 if(navigation_checkladders(e, v, m1, m2, end, end2, movemode))
208 if(autocvar_bot_debug_tracewalk)
211 debugnodestatus(v, DEBUG_NODE_SUCCESS);
214 //print("tracewalk: ", vtos(start), " can reach ", vtos(end), "\n");
218 if(autocvar_bot_debug_tracewalk)
219 debugnodestatus(org, DEBUG_NODE_FAIL);
222 //print("tracewalk: ", vtos(start), " failed under water\n");
225 // successfully jumped obstacle up out of water
227 tracebox(move, m1, m2, move + '0 0 -65536', movemode, e);
228 if(trace_endpos != move)
229 if(autocvar_bot_debug_tracewalk)
234 swimming_outwater = false;
240 float height = trace_endpos.z - org.z;
242 // successfully advanced by swimming or step-swimming
245 if(height > 0 && (swimming || !SUBMERGED(org)))
248 if(!swimming_outwater && !WATERFEET(org))
250 // put it back in the water if it gets out of water
255 } while(org.z > height);
256 swimming_outwater = true;
260 else // if (!((trace_dpstartcontents & DPCONTENTS_LIQUIDSMASK) || swimming))
266 vector move = org + dir * stepdist;
267 tracebox(org, m1, m2, move, movemode, e);
269 if(autocvar_bot_debug_tracewalk)
270 debugnode(e, trace_endpos);
273 if (trace_fraction < 1)
275 // check if we can walk over this obstacle, possibly by jumpstepping
276 tracebox(org + stepheightvec, m1, m2, move + stepheightvec, movemode, e);
277 if (trace_fraction < 1 || trace_startsolid)
279 tracebox(org + jumpstepheightvec, m1, m2, move + jumpstepheightvec, movemode, e);
280 if (trace_fraction < 1 || trace_startsolid)
282 vector v = trace_endpos - jumpstepheightvec + jumpheight_vec;
283 if(navigation_checkladders(e, v, m1, m2, end, end2, movemode))
285 if(autocvar_bot_debug_tracewalk)
288 debugnodestatus(v, DEBUG_NODE_SUCCESS);
291 //print("tracewalk: ", vtos(start), " can reach ", vtos(end), "\n");
295 if(autocvar_bot_debug_tracewalk)
296 debugnodestatus(trace_endpos, DEBUG_NODE_WARNING);
298 traceline( org, move, movemode, e);
300 if ( trace_ent.classname == "door_rotating" || trace_ent.classname == "door")
304 while(trace_ent.classname == "door_rotating" || trace_ent.classname == "door")
306 nextmove = move + (dir * stepdist);
307 traceline( move, nextmove, movemode, e);
310 dist = vlen(vec2(end - move));
314 if(autocvar_bot_debug_tracewalk)
315 debugnodestatus(trace_endpos, DEBUG_NODE_FAIL);
317 //print("tracewalk: ", vtos(start), " hit something when trying to reach ", vtos(end), "\n");
318 //te_explosion(trace_endpos);
319 //print(ftos(e.dphitcontentsmask), "\n");
320 return false; // failed
332 // trace down from stepheight as far as possible and move there,
333 // if this starts in solid we try again without the stepup, and
334 // if that also fails we assume it is a wall
335 // (this is the same logic as the Quake walkmove function used)
336 tracebox(move, m1, m2, move + '0 0 -65536', movemode, e);
340 if(org.z < move.z && SUBMERGED(org))
342 // ended up underwater while walking, resurface
343 if(autocvar_bot_debug_tracewalk)
347 swimming_outwater = true;
352 //print("tracewalk: ", vtos(start), " did not arrive at ", vtos(end), " but at ", vtos(org), "\n");
354 // moved but didn't arrive at the intended destination
355 if(autocvar_bot_debug_tracewalk)
356 debugnodestatus(org, DEBUG_NODE_FAIL);
361 /////////////////////////////////////////////////////////////////////////////
363 /////////////////////////////////////////////////////////////////////////////
365 // completely empty the goal stack, used when deciding where to go
366 void navigation_clearroute(entity this)
368 this.goalcurrent_prev = this.goalcurrent;
369 this.goalcurrent_distance = 10000000;
370 this.goalcurrent_distance_time = 0;
371 //print("bot ", etos(this), " clear\n");
372 this.goalentity = NULL;
373 this.goalcurrent = NULL;
374 this.goalstack01 = NULL;
375 this.goalstack02 = NULL;
376 this.goalstack03 = NULL;
377 this.goalstack04 = NULL;
378 this.goalstack05 = NULL;
379 this.goalstack06 = NULL;
380 this.goalstack07 = NULL;
381 this.goalstack08 = NULL;
382 this.goalstack09 = NULL;
383 this.goalstack10 = NULL;
384 this.goalstack11 = NULL;
385 this.goalstack12 = NULL;
386 this.goalstack13 = NULL;
387 this.goalstack14 = NULL;
388 this.goalstack15 = NULL;
389 this.goalstack16 = NULL;
390 this.goalstack17 = NULL;
391 this.goalstack18 = NULL;
392 this.goalstack19 = NULL;
393 this.goalstack20 = NULL;
394 this.goalstack21 = NULL;
395 this.goalstack22 = NULL;
396 this.goalstack23 = NULL;
397 this.goalstack24 = NULL;
398 this.goalstack25 = NULL;
399 this.goalstack26 = NULL;
400 this.goalstack27 = NULL;
401 this.goalstack28 = NULL;
402 this.goalstack29 = NULL;
403 this.goalstack30 = NULL;
404 this.goalstack31 = NULL;
407 // add a new goal at the beginning of the stack
408 // (in other words: add a new prerequisite before going to the later goals)
409 // NOTE: when a waypoint is added, the WP gets pushed first, then the
410 // next-closest WP on the shortest path to the WP
411 // That means, if the stack overflows, the bot will know how to do the FIRST 32
412 // steps to the goal, and then recalculate the path.
413 void navigation_pushroute(entity this, entity e)
415 this.goalcurrent_prev = this.goalcurrent;
416 this.goalcurrent_distance = 10000000;
417 this.goalcurrent_distance_time = 0;
418 //print("bot ", etos(this), " push ", etos(e), "\n");
419 if(this.goalstack31 == this.goalentity)
420 this.goalentity = NULL;
421 this.goalstack31 = this.goalstack30;
422 this.goalstack30 = this.goalstack29;
423 this.goalstack29 = this.goalstack28;
424 this.goalstack28 = this.goalstack27;
425 this.goalstack27 = this.goalstack26;
426 this.goalstack26 = this.goalstack25;
427 this.goalstack25 = this.goalstack24;
428 this.goalstack24 = this.goalstack23;
429 this.goalstack23 = this.goalstack22;
430 this.goalstack22 = this.goalstack21;
431 this.goalstack21 = this.goalstack20;
432 this.goalstack20 = this.goalstack19;
433 this.goalstack19 = this.goalstack18;
434 this.goalstack18 = this.goalstack17;
435 this.goalstack17 = this.goalstack16;
436 this.goalstack16 = this.goalstack15;
437 this.goalstack15 = this.goalstack14;
438 this.goalstack14 = this.goalstack13;
439 this.goalstack13 = this.goalstack12;
440 this.goalstack12 = this.goalstack11;
441 this.goalstack11 = this.goalstack10;
442 this.goalstack10 = this.goalstack09;
443 this.goalstack09 = this.goalstack08;
444 this.goalstack08 = this.goalstack07;
445 this.goalstack07 = this.goalstack06;
446 this.goalstack06 = this.goalstack05;
447 this.goalstack05 = this.goalstack04;
448 this.goalstack04 = this.goalstack03;
449 this.goalstack03 = this.goalstack02;
450 this.goalstack02 = this.goalstack01;
451 this.goalstack01 = this.goalcurrent;
452 this.goalcurrent = e;
455 // remove first goal from stack
456 // (in other words: remove a prerequisite for reaching the later goals)
457 // (used when a spawnfunc_waypoint is reached)
458 void navigation_poproute(entity this)
460 this.goalcurrent_prev = this.goalcurrent;
461 this.goalcurrent_distance = 10000000;
462 this.goalcurrent_distance_time = 0;
463 //print("bot ", etos(this), " pop\n");
464 if(this.goalcurrent == this.goalentity)
465 this.goalentity = NULL;
466 this.goalcurrent = this.goalstack01;
467 this.goalstack01 = this.goalstack02;
468 this.goalstack02 = this.goalstack03;
469 this.goalstack03 = this.goalstack04;
470 this.goalstack04 = this.goalstack05;
471 this.goalstack05 = this.goalstack06;
472 this.goalstack06 = this.goalstack07;
473 this.goalstack07 = this.goalstack08;
474 this.goalstack08 = this.goalstack09;
475 this.goalstack09 = this.goalstack10;
476 this.goalstack10 = this.goalstack11;
477 this.goalstack11 = this.goalstack12;
478 this.goalstack12 = this.goalstack13;
479 this.goalstack13 = this.goalstack14;
480 this.goalstack14 = this.goalstack15;
481 this.goalstack15 = this.goalstack16;
482 this.goalstack16 = this.goalstack17;
483 this.goalstack17 = this.goalstack18;
484 this.goalstack18 = this.goalstack19;
485 this.goalstack19 = this.goalstack20;
486 this.goalstack20 = this.goalstack21;
487 this.goalstack21 = this.goalstack22;
488 this.goalstack22 = this.goalstack23;
489 this.goalstack23 = this.goalstack24;
490 this.goalstack24 = this.goalstack25;
491 this.goalstack25 = this.goalstack26;
492 this.goalstack26 = this.goalstack27;
493 this.goalstack27 = this.goalstack28;
494 this.goalstack28 = this.goalstack29;
495 this.goalstack29 = this.goalstack30;
496 this.goalstack30 = this.goalstack31;
497 this.goalstack31 = NULL;
500 // walking to wp (walkfromwp == false) v2 and v2_height will be used as
501 // waypoint destination coordinates instead of v (only useful for box waypoints)
502 // for normal waypoints v2 == v and v2_height == 0
503 float navigation_waypoint_will_link(vector v, vector org, entity ent, vector v2, float v2_height, float walkfromwp, float bestdist)
505 if (vdist(v - org, <, bestdist))
507 traceline(v, org, true, ent);
508 if (trace_fraction == 1)
512 if (tracewalk(ent, v, PL_MIN_CONST, PL_MAX_CONST, org, 0, bot_navigation_movemode))
517 if (tracewalk(ent, org, PL_MIN_CONST, PL_MAX_CONST, v2, v2_height, bot_navigation_movemode))
525 // find the spawnfunc_waypoint near a dynamic goal such as a dropped weapon
526 entity navigation_findnearestwaypoint_withdist_except(entity ent, float walkfromwp, float bestdist, entity except)
528 vector pm1 = ent.origin + ent.mins;
529 vector pm2 = ent.origin + ent.maxs;
531 // do two scans, because box test is cheaper
532 IL_EACH(g_waypoints, it != ent && it != except,
534 if(boxesoverlap(pm1, pm2, it.absmin, it.absmax))
538 vector org = ent.origin + 0.5 * (ent.mins + ent.maxs);
539 org.z = ent.origin.z + ent.mins.z - PL_MIN_CONST.z; // player height
540 // TODO possibly make other code have the same support for bboxes
542 org = org + ent.tag_entity.origin;
543 if (navigation_testtracewalk)
549 if(!autocvar_g_waypointeditor && !ent.navigation_dynamicgoal)
551 waypoint_clearlinks(ent); // initialize wpXXmincost fields
552 IL_EACH(g_waypoints, it != ent,
554 if(walkfromwp && (it.wpflags & WAYPOINTFLAG_NORELINK))
561 vector wm1 = it.origin + it.mins;
562 vector wm2 = it.origin + it.maxs;
563 v.x = bound(wm1_x, org.x, wm2_x);
564 v.y = bound(wm1_y, org.y, wm2_y);
565 v.z = bound(wm1_z, org.z, wm2_z);
569 v2_height = wm2.z - wm1.z;
577 if(navigation_waypoint_will_link(v, org, ent, v2, v2_height, walkfromwp, 1050))
578 navigation_item_addlink(it, ent);
582 // box check failed, try walk
583 IL_EACH(g_waypoints, it != ent,
585 if(walkfromwp && (it.wpflags & WAYPOINTFLAG_NORELINK))
592 vector wm1 = it.origin + it.mins;
593 vector wm2 = it.origin + it.maxs;
594 v.x = bound(wm1_x, org.x, wm2_x);
595 v.y = bound(wm1_y, org.y, wm2_y);
596 v.z = bound(wm1_z, org.z, wm2_z);
600 v2_height = wm2.z - wm1.z;
608 if(navigation_waypoint_will_link(v, org, ent, v2, v2_height, walkfromwp, bestdist))
610 bestdist = vlen(v - org);
616 entity navigation_findnearestwaypoint(entity ent, float walkfromwp)
618 entity wp = navigation_findnearestwaypoint_withdist_except(ent, walkfromwp, 1050, NULL);
619 if (autocvar_g_waypointeditor_auto)
621 entity wp2 = navigation_findnearestwaypoint_withdist_except(ent, walkfromwp, 1050, wp);
623 wp.wpflags |= WAYPOINTFLAG_PROTECTED;
628 // finds the waypoints near the bot initiating a navigation query
629 float navigation_markroutes_nearestwaypoints(entity this, float maxdist)
632 //navigation_testtracewalk = true;
635 IL_EACH(g_waypoints, !it.wpconsidered,
639 m1 = it.origin + it.mins;
640 m2 = it.origin + it.maxs;
642 v.x = bound(m1_x, v.x, m2_x);
643 v.y = bound(m1_y, v.y, m2_y);
645 v_height = m2.z - m1.z;
652 vector diff = v - this.origin;
653 diff.z = max(0, diff.z);
654 if(vdist(diff, <, maxdist))
656 it.wpconsidered = true;
657 if (tracewalk(this, this.origin, this.mins, this.maxs, v, v_height, bot_navigation_movemode))
659 it.wpnearestpoint = v;
660 it.wpcost = waypoint_gettravelcost(this.origin, v) + it.dmg;
667 //navigation_testtracewalk = false;
671 // updates a path link if a spawnfunc_waypoint link is better than the current one
672 void navigation_markroutes_checkwaypoint(entity w, entity wp, float cost, vector p)
681 v.x = bound(m1_x, p.x, m2_x);
682 v.y = bound(m1_y, p.y, m2_y);
683 v.z = bound(m1_z, p.z, m2_z);
687 if (w.wpflags & WAYPOINTFLAG_TELEPORT)
688 cost += w.wp00mincost; // assuming teleport has exactly one destination
690 cost += waypoint_gettravelcost(p, v);
691 if (wp.wpcost > cost)
696 wp.wpnearestpoint = v;
700 // queries the entire spawnfunc_waypoint network for pathes leading away from the bot
701 void navigation_markroutes(entity this, entity fixed_source_waypoint)
706 IL_EACH(g_waypoints, true,
708 it.wpconsidered = false;
709 it.wpnearestpoint = '0 0 0';
710 it.wpcost = 10000000;
715 if(fixed_source_waypoint)
717 fixed_source_waypoint.wpconsidered = true;
718 fixed_source_waypoint.wpnearestpoint = fixed_source_waypoint.origin + 0.5 * (fixed_source_waypoint.mins + fixed_source_waypoint.maxs);
719 fixed_source_waypoint.wpcost = fixed_source_waypoint.dmg;
720 fixed_source_waypoint.wpfire = 1;
721 fixed_source_waypoint.enemy = NULL;
725 // try a short range search for the nearest waypoints, and expand the search repeatedly if none are found
726 // as this search is expensive we will use lower values if the bot is on the air
727 float increment, maxdistance;
728 if(IS_ONGROUND(this))
739 for(int j = increment; !navigation_markroutes_nearestwaypoints(this, j) && j < maxdistance; j += increment);
742 bool searching = true;
746 IL_EACH(g_waypoints, it.wpfire,
751 p = it.wpnearestpoint;
753 wp = it.wp00;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp00mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
754 wp = it.wp01;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp01mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
755 wp = it.wp02;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp02mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
756 wp = it.wp03;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp03mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
757 wp = it.wp04;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp04mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
758 wp = it.wp05;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp05mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
759 wp = it.wp06;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp06mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
760 wp = it.wp07;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp07mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
761 wp = it.wp08;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp08mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
762 wp = it.wp09;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp09mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
763 wp = it.wp10;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp10mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
764 wp = it.wp11;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp11mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
765 wp = it.wp12;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp12mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
766 wp = it.wp13;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp13mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
767 wp = it.wp14;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp14mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
768 wp = it.wp15;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp15mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
769 wp = it.wp16;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp16mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
770 wp = it.wp17;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp17mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
771 wp = it.wp18;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp18mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
772 wp = it.wp19;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp19mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
773 wp = it.wp20;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp20mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
774 wp = it.wp21;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp21mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
775 wp = it.wp22;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp22mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
776 wp = it.wp23;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp23mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
777 wp = it.wp24;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp24mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
778 wp = it.wp25;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp25mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
779 wp = it.wp26;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp26mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
780 wp = it.wp27;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp27mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
781 wp = it.wp28;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp28mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
782 wp = it.wp29;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp29mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
783 wp = it.wp30;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp30mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
784 wp = it.wp31;if (wp){cost2 = cost + wp.dmg;if (wp.wpcost > cost2 + it.wp31mincost) navigation_markroutes_checkwaypoint(it, wp, cost2, p);
785 }}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}
790 // queries the entire spawnfunc_waypoint network for pathes leading to the bot
791 void navigation_markroutes_inverted(entity fixed_source_waypoint)
795 IL_EACH(g_waypoints, true,
797 it.wpconsidered = false;
798 it.wpnearestpoint = '0 0 0';
799 it.wpcost = 10000000;
804 if(fixed_source_waypoint)
806 fixed_source_waypoint.wpconsidered = true;
807 fixed_source_waypoint.wpnearestpoint = fixed_source_waypoint.origin + 0.5 * (fixed_source_waypoint.mins + fixed_source_waypoint.maxs);
808 fixed_source_waypoint.wpcost = fixed_source_waypoint.dmg; // the cost to get from X to fixed_source_waypoint
809 fixed_source_waypoint.wpfire = 1;
810 fixed_source_waypoint.enemy = NULL;
814 error("need to start with a waypoint\n");
817 bool searching = true;
821 IL_EACH(g_waypoints, it.wpfire,
825 cost = it.wpcost; // cost to walk from it to home
826 p = it.wpnearestpoint;
828 IL_EACH(g_waypoints, it != wp,
830 if(!waypoint_islinked(it, wp))
832 cost2 = cost + it.dmg;
833 navigation_markroutes_checkwaypoint(wp, it, cost2, p);
839 // updates the best goal according to a weighted calculation of travel cost and item value of a new proposed item
840 void navigation_routerating(entity this, entity e, float f, float rangebias)
848 rangebias = waypoint_getlinearcost(rangebias);
849 f = waypoint_getlinearcost(f);
853 bool rate_wps = false;
854 if((e.flags & FL_INWATER) || (e.flags & FL_PARTIALGROUND))
859 traceline(e.origin, e.origin + '0 0 -1500', true, NULL);
860 int t = pointcontents(trace_endpos + '0 0 1');
861 if(t != CONTENT_SOLID )
863 if(t == CONTENT_WATER || t == CONTENT_SLIME || t == CONTENT_LAVA)
865 else if(tracebox_hits_trigger_hurt(e.origin, e.mins, e.maxs, trace_endpos))
873 entity best_wp = NULL;
874 float best_dist = 10000;
875 IL_EACH(g_waypoints, vdist(it.origin - theEnemy.origin, <, 500)
876 && vdist(it.origin - this.origin, >, 100)
877 && !(it.wpflags & WAYPOINTFLAG_TELEPORT),
879 float dist = vlen(it.origin - theEnemy.origin);
880 if (dist < best_dist)
892 vector goal_org = (e.absmin + e.absmax) * 0.5;
894 //print("routerating ", etos(e), " = ", ftos(f), " - ", ftos(rangebias), "\n");
896 // Evaluate path using jetpack
898 if(this.items & IT_JETPACK)
899 if(autocvar_bot_ai_navigation_jetpack)
900 if(vdist(this.origin - goal_org, >, autocvar_bot_ai_navigation_jetpack_mindistance))
902 vector pointa, pointb;
904 LOG_DEBUG("jetpack ai: evaluating path for ", e.classname);
907 traceline(this.origin, this.origin + '0 0 65535', MOVE_NORMAL, this);
908 pointa = trace_endpos - '0 0 1';
911 traceline(goal_org, goal_org + '0 0 65535', MOVE_NORMAL, e);
912 pointb = trace_endpos - '0 0 1';
914 // Can I see these two points from the sky?
915 traceline(pointa, pointb, MOVE_NORMAL, this);
917 if(trace_fraction==1)
919 LOG_DEBUG("jetpack ai: can bridge these two points");
921 // Lower the altitude of these points as much as possible
922 float zdistance, xydistance, cost, t, fuel;
923 vector down, npa, npb;
925 down = '0 0 -1' * (STAT(PL_MAX, this).z - STAT(PL_MIN, this).z) * 10;
931 if(npa.z<=this.absmax.z)
934 if(npb.z<=e.absmax.z)
937 traceline(npa, npb, MOVE_NORMAL, this);
938 if(trace_fraction==1)
944 while(trace_fraction == 1);
947 // Rough estimation of fuel consumption
948 // (ignores acceleration and current xyz velocity)
949 xydistance = vlen(pointa - pointb);
950 zdistance = fabs(pointa.z - this.origin.z);
952 t = zdistance / autocvar_g_jetpack_maxspeed_up;
953 t += xydistance / autocvar_g_jetpack_maxspeed_side;
954 fuel = t * autocvar_g_jetpack_fuel * 0.8;
956 LOG_DEBUG("jetpack ai: required fuel ", ftos(fuel), " this.ammo_fuel ", ftos(this.ammo_fuel));
959 if(this.ammo_fuel>fuel)
962 // (as onground costs calculation is mostly based on distances, here we do the same establishing some relationship
963 // - between air and ground speeds)
965 cost = xydistance / (autocvar_g_jetpack_maxspeed_side/autocvar_sv_maxspeed);
966 cost += zdistance / (autocvar_g_jetpack_maxspeed_up/autocvar_sv_maxspeed);
969 // Compare against other goals
970 f = f * rangebias / (rangebias + cost);
972 if (navigation_bestrating < f)
974 LOG_DEBUG("jetpack path: added goal ", e.classname, " (with rating ", ftos(f), ")");
975 navigation_bestrating = f;
976 navigation_bestgoal = e;
977 this.navigation_jetpack_goal = e;
978 this.navigation_jetpack_point = pointb;
986 //te_wizspike(e.origin);
989 // update the cached spawnfunc_waypoint link on a dynamic item entity
990 if(e.classname == "waypoint" && !(e.wpflags & WAYPOINTFLAG_PERSONAL))
996 if(autocvar_g_waypointeditor && e.nearestwaypointtimeout >= 0 && time > e.nearestwaypointtimeout)
997 e.nearestwaypoint = NULL;
999 if ((!e.nearestwaypoint || e.navigation_dynamicgoal)
1000 && e.nearestwaypointtimeout >= 0 && time > e.nearestwaypointtimeout)
1002 nwp = navigation_findnearestwaypoint(e, true);
1005 e.nearestwaypoint = nwp;
1007 vector m1 = nwp.absmin, m2 = nwp.absmax;
1008 m1.x = nwp.origin.x; m1.y = nwp.origin.y;
1009 m2.x = nwp.origin.x; m2.y = nwp.origin.y;
1010 vector ve = (e.absmin - e.absmax) * 0.5;
1011 ve.x = bound(m1.x, ve.x, m2.x);
1012 ve.y = bound(m1.y, ve.y, m2.y);
1013 ve.z = bound(m1.z, ve.z, m2.z);
1015 m1 = e.absmin; m2 = e.absmax;
1016 m1.x = e.origin.x; m1.y = e.origin.y;
1017 m2.x = e.origin.x; m2.y = e.origin.y;
1018 vector vnwp = nwp.origin;
1019 vnwp.x = bound(m1.x, vnwp.x, m2.x);
1020 vnwp.y = bound(m1.y, vnwp.y, m2.y);
1021 vnwp.z = bound(m1.z, vnwp.z, m2.z);
1022 e.nearestwaypoint_dist = vlen(ve - vnwp);
1026 LOG_DEBUG("FAILED to find a nearest waypoint to '", e.classname, "' #", etos(e));
1028 if(!e.navigation_dynamicgoal)
1029 e.blacklisted = true;
1033 LOG_DEBUG("The entity '", e.classname, "' is going to be excluded from path finding during this match");
1038 if(e.navigation_dynamicgoal)
1039 e.nearestwaypointtimeout = time + 2;
1040 else if(autocvar_g_waypointeditor)
1041 e.nearestwaypointtimeout = time + 3 + random() * 2;
1043 nwp = e.nearestwaypoint;
1046 LOG_DEBUG("-- checking ", e.classname, " (with cost ", ftos(nwp.wpcost), ")");
1048 if (nwp.wpcost < 10000000)
1050 //te_wizspike(nwp.wpnearestpoint);
1051 float cost = nwp.wpcost + waypoint_gettravelcost(nwp.wpnearestpoint, goal_org);
1052 LOG_DEBUG(e.classname, " ", ftos(f), "/(1+", ftos(cost), "/", ftos(rangebias), ") = ");
1053 f = f * rangebias / (rangebias + cost);
1054 LOG_DEBUG("considering ", e.classname, " (with rating ", ftos(f), ")");
1055 if (navigation_bestrating < f)
1057 LOG_DEBUG("ground path: added goal ", e.classname, " (with rating ", ftos(f), ")");
1058 navigation_bestrating = f;
1059 navigation_bestgoal = e;
1064 // adds an item to the the goal stack with the path to a given item
1065 bool navigation_routetogoal(entity this, entity e, vector startposition)
1067 // if there is no goal, just exit
1071 if(e.wpflags & WAYPOINTFLAG_TELEPORT)
1073 // force teleport destination as route destination
1078 this.goalentity = e;
1080 // put the entity on the goal stack
1081 //print("routetogoal ", etos(e), "\n");
1082 navigation_pushroute(this, e);
1084 if(e.classname == "waypoint" && !(e.wpflags & WAYPOINTFLAG_PERSONAL))
1086 this.wp_goal_prev1 = this.wp_goal_prev0;
1087 this.wp_goal_prev0 = e;
1091 if(e==this.navigation_jetpack_goal)
1094 // if it can reach the goal there is nothing more to do
1095 vector dest = (e.absmin + e.absmax) * 0.5;
1096 dest.z = e.absmin.z;
1097 float dest_height = e.absmax.z - e.absmin.z;
1098 if (tracewalk(this, startposition, STAT(PL_MIN, this), STAT(PL_MAX, this), dest, dest_height, bot_navigation_movemode))
1101 entity nearest_wp = NULL;
1102 // see if there are waypoints describing a path to the item
1103 if(e.classname != "waypoint" || (e.wpflags & WAYPOINTFLAG_PERSONAL))
1105 e = e.nearestwaypoint;
1109 e = e.enemy; // we already have added it, so...
1114 if(nearest_wp && nearest_wp.enemy)
1116 // often path can be optimized by not adding the nearest waypoint
1117 if (this.goalentity.nearestwaypoint_dist < 8)
1118 e = nearest_wp.enemy;
1121 if (this.goalentity.navigation_dynamicgoal)
1123 vector dest = (this.goalentity.absmin + this.goalentity.absmax) * 0.5;
1124 dest.z = this.goalentity.absmin.z;
1125 float dest_height = this.goalentity.absmax.z - this.goalentity.absmin.z;
1126 if(tracewalk(this, nearest_wp.enemy.origin, STAT(PL_MIN, this), STAT(PL_MAX, this), dest, dest_height, bot_navigation_movemode))
1127 e = nearest_wp.enemy;
1129 else if(navigation_item_islinked(nearest_wp.enemy, this.goalentity))
1130 e = nearest_wp.enemy;
1136 // add the spawnfunc_waypoint to the path
1137 navigation_pushroute(this, e);
1147 // removes any currently touching waypoints from the goal stack
1148 // (this is how bots detect if they reached a goal)
1149 void navigation_poptouchedgoals(entity this)
1151 if(this.goalcurrent.wpflags & WAYPOINTFLAG_TELEPORT)
1153 // make sure jumppad is really hit, don't rely on distance based checks
1154 // as they may report a touch even if it didn't really happen
1155 if(this.lastteleporttime > 0
1156 && time - this.lastteleporttime < ((this.goalcurrent.wpflags & WAYPOINTFLAG_PERSONAL) ? 2 : 0.15))
1158 if(this.aistatus & AI_STATUS_WAYPOINT_PERSONAL_GOING)
1159 if(this.goalcurrent.wpflags & WAYPOINTFLAG_PERSONAL && this.goalcurrent.owner==this)
1161 this.aistatus &= ~AI_STATUS_WAYPOINT_PERSONAL_GOING;
1162 this.aistatus |= AI_STATUS_WAYPOINT_PERSONAL_REACHED;
1164 navigation_poproute(this);
1170 // If for some reason the bot is closer to the next goal, pop the current one
1171 if(this.goalstack01 && !wasfreed(this.goalstack01))
1172 if(vlen2(this.goalcurrent.origin - this.origin) > vlen2(this.goalstack01.origin - this.origin))
1173 if(checkpvs(this.origin + this.view_ofs, this.goalstack01))
1175 vector dest = (this.goalstack01.absmin + this.goalstack01.absmax) * 0.5;
1176 dest.z = this.goalstack01.absmin.z;
1177 float dest_height = this.goalstack01.absmax.z - this.goalstack01.absmin.z;
1178 if(tracewalk(this, this.origin, this.mins, this.maxs, dest, dest_height, bot_navigation_movemode))
1180 LOG_DEBUG("path optimized for ", this.netname, ", removed a goal from the queue");
1181 navigation_poproute(this);
1182 // TODO this may also be a nice idea to do "early" (e.g. by
1183 // manipulating the vlen() comparisons) to shorten paths in
1184 // general - this would make bots walk more "on rails" than
1185 // "zigzagging" which they currently do with sufficiently
1186 // random-like waypoints, and thus can make a nice bot
1187 // personality property
1191 // Loose goal touching check when running
1192 if(this.aistatus & AI_STATUS_RUNNING)
1193 if(this.goalcurrent.classname=="waypoint")
1194 if(vdist(vec2(this.velocity), >=, autocvar_sv_maxspeed)) // if -really- running
1196 if(vdist(this.origin - this.goalcurrent.origin, <, 150))
1198 traceline(this.origin + this.view_ofs , this.goalcurrent.origin, true, NULL);
1199 if(trace_fraction==1)
1201 // Detect personal waypoints
1202 if(this.aistatus & AI_STATUS_WAYPOINT_PERSONAL_GOING)
1203 if(this.goalcurrent.wpflags & WAYPOINTFLAG_PERSONAL && this.goalcurrent.owner==this)
1205 this.aistatus &= ~AI_STATUS_WAYPOINT_PERSONAL_GOING;
1206 this.aistatus |= AI_STATUS_WAYPOINT_PERSONAL_REACHED;
1209 navigation_poproute(this);
1214 while (this.goalcurrent && !IS_PLAYER(this.goalcurrent))
1216 vector gc_min = this.goalcurrent.absmin;
1217 vector gc_max = this.goalcurrent.absmax;
1218 if(this.goalcurrent.classname == "waypoint" && !this.goalcurrent.wpisbox)
1220 gc_min = this.goalcurrent.origin - '1 1 1' * 12;
1221 gc_max = this.goalcurrent.origin + '1 1 1' * 12;
1223 if(!boxesoverlap(this.absmin, this.absmax, gc_min, gc_max))
1226 // Detect personal waypoints
1227 if(this.aistatus & AI_STATUS_WAYPOINT_PERSONAL_GOING)
1228 if(this.goalcurrent.wpflags & WAYPOINTFLAG_PERSONAL && this.goalcurrent.owner==this)
1230 this.aistatus &= ~AI_STATUS_WAYPOINT_PERSONAL_GOING;
1231 this.aistatus |= AI_STATUS_WAYPOINT_PERSONAL_REACHED;
1234 navigation_poproute(this);
1238 // begin a goal selection session (queries spawnfunc_waypoint network)
1239 void navigation_goalrating_start(entity this)
1241 if(this.aistatus & AI_STATUS_STUCK)
1244 this.navigation_jetpack_goal = NULL;
1245 navigation_bestrating = -1;
1246 navigation_clearroute(this);
1247 navigation_bestgoal = NULL;
1248 navigation_markroutes(this, NULL);
1251 // ends a goal selection session (updates goal stack to the best goal)
1252 void navigation_goalrating_end(entity this)
1254 if(this.aistatus & AI_STATUS_STUCK)
1257 navigation_routetogoal(this, navigation_bestgoal, this.origin);
1258 LOG_DEBUG("best goal ", this.goalcurrent.classname);
1260 // If the bot got stuck then try to reach the farthest waypoint
1261 if (!this.goalentity && autocvar_bot_wander_enable)
1263 if (!(this.aistatus & AI_STATUS_STUCK))
1265 LOG_DEBUG(this.netname, " cannot walk to any goal");
1266 this.aistatus |= AI_STATUS_STUCK;
1271 void botframe_updatedangerousobjects(float maxupdate)
1273 vector m1, m2, v, o;
1276 IL_EACH(g_waypoints, true,
1281 IL_EACH(g_bot_dodge, it.bot_dodge,
1284 v.x = bound(m1_x, v.x, m2_x);
1285 v.y = bound(m1_y, v.y, m2_y);
1286 v.z = bound(m1_z, v.z, m2_z);
1287 o = (it.absmin + it.absmax) * 0.5;
1288 d = waypoint_getlinearcost(it.bot_dodgerating) - waypoint_gettravelcost(o, v);
1291 traceline(o, v, true, NULL);
1292 if (trace_fraction == 1)
1293 danger = danger + d;
1303 void navigation_unstuck(entity this)
1305 float search_radius = 1000;
1307 if (!autocvar_bot_wander_enable)
1310 if (!bot_waypoint_queue_owner)
1312 LOG_DEBUG(this.netname, " stuck, taking over the waypoints queue");
1313 bot_waypoint_queue_owner = this;
1314 bot_waypoint_queue_bestgoal = NULL;
1315 bot_waypoint_queue_bestgoalrating = 0;
1318 if(bot_waypoint_queue_owner!=this)
1321 if (bot_waypoint_queue_goal)
1323 // evaluate the next goal on the queue
1324 float d = vlen2(this.origin - bot_waypoint_queue_goal.origin);
1325 LOG_DEBUG(this.netname, " evaluating ", bot_waypoint_queue_goal.classname, " with distance ", ftos(d));
1326 vector dest = (bot_waypoint_queue_goal.absmin + bot_waypoint_queue_goal.absmax) * 0.5;
1327 dest.z = bot_waypoint_queue_goal.absmin.z;
1328 float dest_height = bot_waypoint_queue_goal.absmax.z - bot_waypoint_queue_goal.absmin.z;
1329 if(tracewalk(bot_waypoint_queue_goal, this.origin, STAT(PL_MIN, this), STAT(PL_MAX, this), dest, dest_height, bot_navigation_movemode))
1331 if( d > bot_waypoint_queue_bestgoalrating)
1333 bot_waypoint_queue_bestgoalrating = d;
1334 bot_waypoint_queue_bestgoal = bot_waypoint_queue_goal;
1337 bot_waypoint_queue_goal = bot_waypoint_queue_goal.bot_waypoint_queue_nextgoal;
1339 if (!bot_waypoint_queue_goal)
1341 if (bot_waypoint_queue_bestgoal)
1343 LOG_DEBUG(this.netname, " stuck, reachable waypoint found, heading to it");
1344 navigation_routetogoal(this, bot_waypoint_queue_bestgoal, this.origin);
1345 this.bot_strategytime = time + autocvar_bot_ai_strategyinterval;
1346 this.aistatus &= ~AI_STATUS_STUCK;
1350 LOG_DEBUG(this.netname, " stuck, cannot walk to any waypoint at all");
1353 bot_waypoint_queue_owner = NULL;
1358 if(bot_strategytoken!=this)
1361 // build a new queue
1362 LOG_DEBUG(this.netname, " stuck, scanning reachable waypoints within ", ftos(search_radius)," qu");
1364 entity first = NULL;
1366 FOREACH_ENTITY_RADIUS(this.origin, search_radius, it.classname == "waypoint" && !(it.wpflags & WAYPOINTFLAG_GENERATED),
1368 if(bot_waypoint_queue_goal)
1369 bot_waypoint_queue_goal.bot_waypoint_queue_nextgoal = it;
1373 bot_waypoint_queue_goal = it;
1374 bot_waypoint_queue_goal.bot_waypoint_queue_nextgoal = NULL;
1378 bot_waypoint_queue_goal = first;
1381 LOG_DEBUG(this.netname, " stuck, cannot walk to any waypoint at all");
1382 bot_waypoint_queue_owner = NULL;
1387 // Support for debugging tracewalk visually
1389 void debugresetnodes()
1391 debuglastnode = '0 0 0';
1394 void debugnode(entity this, vector node)
1396 if (!IS_PLAYER(this))
1399 if(debuglastnode=='0 0 0')
1401 debuglastnode = node;
1405 te_lightning2(NULL, node, debuglastnode);
1406 debuglastnode = node;
1409 void debugnodestatus(vector position, float status)
1415 case DEBUG_NODE_SUCCESS:
1418 case DEBUG_NODE_WARNING:
1421 case DEBUG_NODE_FAIL:
1428 te_customflash(position, 40, 2, c);
1431 // Support for debugging the goal stack visually
1434 .vector lastposition;
1436 // Debug the goal stack visually
1437 void debuggoalstack(entity this)
1442 if(this.goalcounter==0)goal=this.goalcurrent;
1443 else if(this.goalcounter==1)goal=this.goalstack01;
1444 else if(this.goalcounter==2)goal=this.goalstack02;
1445 else if(this.goalcounter==3)goal=this.goalstack03;
1446 else if(this.goalcounter==4)goal=this.goalstack04;
1447 else if(this.goalcounter==5)goal=this.goalstack05;
1448 else if(this.goalcounter==6)goal=this.goalstack06;
1449 else if(this.goalcounter==7)goal=this.goalstack07;
1450 else if(this.goalcounter==8)goal=this.goalstack08;
1451 else if(this.goalcounter==9)goal=this.goalstack09;
1452 else if(this.goalcounter==10)goal=this.goalstack10;
1453 else if(this.goalcounter==11)goal=this.goalstack11;
1454 else if(this.goalcounter==12)goal=this.goalstack12;
1455 else if(this.goalcounter==13)goal=this.goalstack13;
1456 else if(this.goalcounter==14)goal=this.goalstack14;
1457 else if(this.goalcounter==15)goal=this.goalstack15;
1458 else if(this.goalcounter==16)goal=this.goalstack16;
1459 else if(this.goalcounter==17)goal=this.goalstack17;
1460 else if(this.goalcounter==18)goal=this.goalstack18;
1461 else if(this.goalcounter==19)goal=this.goalstack19;
1462 else if(this.goalcounter==20)goal=this.goalstack20;
1463 else if(this.goalcounter==21)goal=this.goalstack21;
1464 else if(this.goalcounter==22)goal=this.goalstack22;
1465 else if(this.goalcounter==23)goal=this.goalstack23;
1466 else if(this.goalcounter==24)goal=this.goalstack24;
1467 else if(this.goalcounter==25)goal=this.goalstack25;
1468 else if(this.goalcounter==26)goal=this.goalstack26;
1469 else if(this.goalcounter==27)goal=this.goalstack27;
1470 else if(this.goalcounter==28)goal=this.goalstack28;
1471 else if(this.goalcounter==29)goal=this.goalstack29;
1472 else if(this.goalcounter==30)goal=this.goalstack30;
1473 else if(this.goalcounter==31)goal=this.goalstack31;
1478 this.goalcounter = 0;
1479 this.lastposition='0 0 0';
1483 if(this.lastposition=='0 0 0')
1486 org = this.lastposition;
1489 go = ( goal.absmin + goal.absmax ) * 0.5;
1490 te_lightning2(NULL, org, go);
1491 this.lastposition = go;