Skip to content

Commit

Permalink
update bones
Browse files Browse the repository at this point in the history
  • Loading branch information
ineed bots committed Apr 4, 2024
1 parent db9e179 commit f133f5f
Show file tree
Hide file tree
Showing 3 changed files with 65 additions and 53 deletions.
62 changes: 35 additions & 27 deletions maps/mp/bots/_bot_internal.gsc
View file
Original file line number Diff line number Diff line change
Expand Up @@ -916,20 +916,23 @@ updateBones()
{
self endon( "disconnect" );
self endon( "death" );

bones = strtok( self.pers[ "bots" ][ "skill" ][ "bones" ], "," );
waittime = self.pers[ "bots" ][ "skill" ][ "bone_update_interval" ];


for ( ;; )
{
self waittill_notify_or_timeout( "new_enemy", waittime );

if ( !isdefined( self.bot.target ) )
oldbones = self.pers[ "bots" ][ "skill" ][ "bones" ];
bones = strtok( oldbones, "," );

while ( oldbones == self.pers[ "bots" ][ "skill" ][ "bones" ] )
{
continue;
self waittill_notify_or_timeout( "new_enemy", self.pers[ "bots" ][ "skill" ][ "bone_update_interval" ] );

if ( !isdefined( self.bot.target ) )
{
continue;
}

self.bot.target.bone = PickRandom( bones );
}

self.bot.target.bone = PickRandom( bones );
}
}

Expand Down Expand Up @@ -1038,6 +1041,23 @@ targetObjUpdateNoTrace( obj )
obj.didlook = false;
}

/*
Returns true if myEye can see the bone of self
*/
checkTraceForBone( myEye, bone )
{
boneLoc = self gettagorigin( bone );

if ( !isdefined( boneLoc ) )
{
return false;
}

trace = bullettrace( myEye, boneLoc, false, undefined );

return ( sighttracepassed( myEye, boneLoc, false, undefined ) && ( trace[ "fraction" ] >= 1.0 || trace[ "surfacetype" ] == "glass" ) );
}

/*
The main target thread, will update the bot's main target. Will auto target enemy players and handle script targets.
*/
Expand Down Expand Up @@ -1149,21 +1169,9 @@ target_loop()
continue;
}

targetHead = player gettagorigin( "j_head" );
targetAnkleLeft = player gettagorigin( "j_ankle_le" );
targetAnkleRight = player gettagorigin( "j_ankle_ri" );

traceHead = bullettrace( myEye, targetHead, false, undefined );
traceAnkleLeft = bullettrace( myEye, targetAnkleLeft, false, undefined );
traceAnkleRight = bullettrace( myEye, targetAnkleRight, false, undefined );

canTargetPlayer = ( ( sighttracepassed( myEye, targetHead, false, undefined ) ||
sighttracepassed( myEye, targetAnkleLeft, false, undefined ) ||
sighttracepassed( myEye, targetAnkleRight, false, undefined ) )

&& ( ( traceHead[ "fraction" ] >= 1.0 || traceHead[ "surfacetype" ] == "glass" ) ||
( traceAnkleLeft[ "fraction" ] >= 1.0 || traceAnkleLeft[ "surfacetype" ] == "glass" ) ||
( traceAnkleRight[ "fraction" ] >= 1.0 || traceAnkleRight[ "surfacetype" ] == "glass" ) )
canTargetPlayer = ( ( player checkTraceForBone( myEye, "j_head" ) ||
player checkTraceForBone( myEye, "j_ankle_le" ) ||
player checkTraceForBone( myEye, "j_ankle_ri" ) )

&& ( SmokeTrace( myEye, player.origin, level.smokeradius ) ||
daDist < level.bots_maxknifedistance * 4 )
Expand Down Expand Up @@ -2010,9 +2018,9 @@ walk_loop()

dist = 16;

if ( level.waypointcount )
if ( level.waypoints.size )
{
goal = level.waypoints[ randomint( level.waypointcount ) ].origin;
goal = level.waypoints[ randomint( level.waypoints.size ) ].origin;
}
else
{
Expand Down
55 changes: 29 additions & 26 deletions maps/mp/bots/_bot_utility.gsc
View file
Original file line number Diff line number Diff line change
Expand Up @@ -1523,7 +1523,6 @@ load_waypoints()
{
mapname = getdvar( "mapname" );

level.waypointcount = 0;
level.waypointusage = [];
level.waypointusage[ "allies" ] = [];
level.waypointusage[ "axis" ] = [];
Expand Down Expand Up @@ -1560,9 +1559,7 @@ load_waypoints()
BotBuiltinPrintConsole( "No waypoints loaded!" );
}

level.waypointcount = level.waypoints.size;

for ( i = 0; i < level.waypointcount; i++ )
for ( i = level.waypoints.size - 1; i >= 0; i-- )
{
if ( !isdefined( level.waypoints[ i ].children ) || !isdefined( level.waypoints[ i ].children.size ) )
{
Expand Down Expand Up @@ -1661,7 +1658,7 @@ getWaypointsOfType( type )
{
answer = [];

for ( i = 0; i < level.waypointcount; i++ )
for ( i = level.waypoints.size - 1; i >= 0; i-- )
{
wp = level.waypoints[ i ];

Expand Down Expand Up @@ -2601,16 +2598,18 @@ RemoveWaypointUsage( wp, team )
return;
}

if ( !isdefined( level.waypointusage[ team ][ wp + "" ] ) )
wpstr = wp + "";

if ( !isdefined( level.waypointusage[ team ][ wpstr ] ) )
{
return;
}

level.waypointusage[ team ][ wp + "" ]--;
level.waypointusage[ team ][ wpstr ]--;

if ( level.waypointusage[ team ][ wp + "" ] <= 0 )
if ( level.waypointusage[ team ][ wpstr ] <= 0 )
{
level.waypointusage[ team ][ wp + "" ] = undefined;
level.waypointusage[ team ][ wpstr ] = undefined;
}
}

Expand All @@ -2622,7 +2621,7 @@ GetNearestWaypointWithSight( pos )
candidate = undefined;
dist = 2147483647;

for ( i = 0; i < level.waypointcount; i++ )
for ( i = level.waypoints.size - 1; i >= 0; i-- )
{
if ( !bullettracepassed( pos + ( 0, 0, 15 ), level.waypoints[ i ].origin + ( 0, 0, 15 ), false, undefined ) )
{
Expand Down Expand Up @@ -2651,7 +2650,7 @@ getNearestWaypoint( pos )
candidate = undefined;
dist = 2147483647;

for ( i = 0; i < level.waypointcount; i++ )
for ( i = level.waypoints.size - 1; i >= 0; i-- )
{
curdis = distancesquared( level.waypoints[ i ].origin, pos );

Expand Down Expand Up @@ -2736,7 +2735,8 @@ AStarSearch( start, goal, team, greedy_path )
// pop bestnode from queue
bestNode = open.data[ 0 ];
open HeapRemove();
openset[ bestNode.index + "" ] = undefined;
bestNodeStr = bestNode.index + "";
openset[ bestNodeStr ] = undefined;
wp = level.waypoints[ bestNode.index ];

// check if we made it to the goal
Expand All @@ -2746,14 +2746,16 @@ AStarSearch( start, goal, team, greedy_path )

while ( isdefined( bestNode ) )
{
bestNodeStr = bestNode.index + "";

if ( isdefined( team ) && isdefined( level.waypointusage ) )
{
if ( !isdefined( level.waypointusage[ team ][ bestNode.index + "" ] ) )
if ( !isdefined( level.waypointusage[ team ][ bestNodeStr ] ) )
{
level.waypointusage[ team ][ bestNode.index + "" ] = 0;
level.waypointusage[ team ][ bestNodeStr ] = 0;
}

level.waypointusage[ team ][ bestNode.index + "" ]++;
level.waypointusage[ team ][ bestNodeStr ]++;
}

// construct path
Expand All @@ -2769,6 +2771,7 @@ AStarSearch( start, goal, team, greedy_path )
for ( i = wp.children.size - 1; i >= 0; i-- )
{
child = wp.children[ i ];
childStr = child + "";
childWp = level.waypoints[ child ];

penalty = 1;
Expand All @@ -2777,9 +2780,9 @@ AStarSearch( start, goal, team, greedy_path )
{
temppen = 1;

if ( isdefined( level.waypointusage[ team ][ child + "" ] ) )
if ( isdefined( level.waypointusage[ team ][ childStr ] ) )
{
temppen = level.waypointusage[ team ][ child + "" ]; // consider how many bots are taking this path
temppen = level.waypointusage[ team ][ childStr ]; // consider how many bots are taking this path
}

if ( temppen > 1 )
Expand All @@ -2798,16 +2801,16 @@ AStarSearch( start, goal, team, greedy_path )
newg = bestNode.g + distancesquared( wp.origin, childWp.origin ) * penalty; // bots on same team's path are more expensive

// check if this child is in open or close with a g value less than newg
inopen = isdefined( openset[ child + "" ] );
inopen = isdefined( openset[ childStr ] );

if ( inopen && openset[ child + "" ].g <= newg )
if ( inopen && openset[ childStr ].g <= newg )
{
continue;
}

inclosed = isdefined( closed[ child + "" ] );
inclosed = isdefined( closed[ childStr ] );

if ( inclosed && closed[ child + "" ].g <= newg )
if ( inclosed && closed[ childStr ].g <= newg )
{
continue;
}
Expand All @@ -2816,11 +2819,11 @@ AStarSearch( start, goal, team, greedy_path )

if ( inopen )
{
node = openset[ child + "" ];
node = openset[ childStr ];
}
else if ( inclosed )
{
node = closed[ child + "" ];
node = closed[ childStr ];
}
else
{
Expand All @@ -2836,19 +2839,19 @@ AStarSearch( start, goal, team, greedy_path )
// check if in closed, remove it
if ( inclosed )
{
closed[ child + "" ] = undefined;
closed[ childStr ] = undefined;
}

// check if not in open, add it
if ( !inopen )
{
open HeapInsert( node );
openset[ child + "" ] = node;
openset[ childStr ] = node;
}
}

// done with children, push onto closed
closed[ bestNode.index + "" ] = bestNode;
closed[ bestNodeStr ] = bestNode;
}

return [];
Expand Down
1 change: 1 addition & 0 deletions maps/mp/bots/_wp_editor.gsc
View file
Original file line number Diff line number Diff line change
Expand Up @@ -425,6 +425,7 @@ LoadWaypoints()
self deleteAllWaypoints();
self iprintlnbold( "Loading WPS..." );
load_waypoints();
level.waypointcount = level.waypoints.size;

wait 1;

Expand Down

0 comments on commit f133f5f

Please sign in to comment.