Implement the run-decision algorithm in gb_decide_run
#18
Labels
No Label
ai-changes-requested
ai-failed
ai-pr-opened
ai-reviewed
ai-reviewing
ai-working
ai-working
bug
enhancement
feature
in-queue
performance
security
tech-debt
todo
No Milestone
No project
No Assignees
1 Participants
Notifications
Due Date
No due date set.
Dependencies
No dependencies set.
Reference: cal/paper-dynasty-discord#18
Loading…
Reference in New Issue
Block a user
No description provided.
Delete Branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
`in_game/gameplay_models.py:666` has `this_resp.min_safe = 15 - aggression # TODO: write this algorithm`. Currently uses a trivial placeholder formula. The `min_safe` threshold determines when an AI manager chooses to run, affecting game fairness.
PR #72 opened: #72
Replaced the placeholder
15 - aggressionformula with a tier-based algorithm modeled aftertag_from_second/tag_from_third:adjusted_running = self.running + abs(aggression_mod)to combine the manager's running aggressiveness with situational aggressionmin_safetiers: 4 (aggressive, adjusted_running ≥8), 6 (moderate, ≥5), or 8 (conservative)Also added
test_gb_decide_runto the test file covering Balanced (min_safe=6) and Yolo (min_safe=4) scenarios with 1 out.