more expensive

This commit is contained in:
INeedBots 2020-10-25 14:54:58 -06:00
parent 15f0b4fcf1
commit e5ca457672

View File

@ -1636,6 +1636,7 @@ AStarSearch(start, goal, team, greedy_path)
{
child = level.waypoints[bestNode.index].children[i];
childorg = level.waypoints[child].origin;
childtype = level.waypoints[child].type;
penalty = 1;
if(!greedy_path && isdefined(team))
@ -1644,6 +1645,10 @@ AStarSearch(start, goal, team, greedy_path)
if(temppen > 1)
penalty = temppen;
}
// have certain types of nodes more expensive
if (childtype == "climb" || childtype == "prone")
penalty++;
//calc the total path we have took
newg = bestNode.g + DistanceSquared(nodeorg, childorg)*penalty;//bots on same team's path are more expensive