yolinlin/mod-playerbots
1
0
Fork 0
mirror of https://github.com/mod-playerbots/mod-playerbots synced 2025-11-29 15:58:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

Revert "Make AutoScaleActivity further configurable (#766)" (#798)

Browse Source 
This reverts commit 66f0cf27d3.
This commit is contained in:
bash
2024-12-19 00:41:33 +01:00
committed by GitHub
parent 66f0cf27d3
commit ea1ec98645
4 changed files with 13 additions and 40 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
src/PlayerbotAI.cpp
View File

@@ -4352,22 +4352,10 @@ bool PlayerbotAI::AllowActivity(ActivityType activityType, bool checkNow)
uint32 PlayerbotAI::AutoScaleActivity(uint32 mod)
{
uint32 diffLimitFloor = sPlayerbotAIConfig->botActiveAloneSmartScaleDiffLimitFloor;
uint32 diffLimitCeil = sPlayerbotAIConfig->botActiveAloneSmartScaleDiffLimitCeiling;
uint32 chkDiff = (sPlayerbotAIConfig->botActiveAloneSmartScaleDiffMethod == 2)
? sWorldUpdateTime.GetMaxUpdateTime()
: sWorldUpdateTime.GetAverageUpdateTime();
uint32 maxDiff = sWorldUpdateTime.GetAverageUpdateTime();
if (diffLimitFloor > diffLimitCeil)
diffLimitFloor = diffLimitCeil;
if (chkDiff <= diffLimitFloor) return mod;
if (chkDiff >= diffLimitCeil) return 0;
uint32 diffRange = diffLimitCeil - diffLimitFloor;
double spread = (double)diffRange / 5; // Calculate the equal spread between each number /w 5 steps
if (chkDiff > diffLimitFloor + (4 * spread))
if (maxDiff > 500) return 0;
if (maxDiff > 250)
{
if (Map* map = bot->GetMap())
{
@@ -4387,10 +4375,10 @@ uint32 PlayerbotAI::AutoScaleActivity(uint32 mod)
return (mod * 1) / 10;
}
if (chkDiff > diffLimitFloor + (3 * spread)) return (mod * 2) / 10;
if (chkDiff > diffLimitFloor + (2 * spread)) return (mod * 4) / 10;
if (chkDiff > diffLimitFloor + (1 * spread)) return (mod * 7) / 10;
if (chkDiff > diffLimitFloor + (0 * spread)) return (mod * 9) / 10;
if (maxDiff > 200) return (mod * 3) / 10;
if (maxDiff > 150) return (mod * 5) / 10;
if (maxDiff > 100) return (mod * 6) / 10;
if (maxDiff > 75) return (mod * 9) / 10;
return mod;
}