Decide which leaderboard entries should be pruned after a wave (plan §8.3 — "prune unpromising branches"). Two complementary rules, both optional:
bestScore * relativePruneThreshold
An entry pruned by either rule is returned. The set is deterministic (ranking is stable) and never prunes the single best entry.
the current leaderboard (one entry per completed iteration)
the prune rules (either/both/none)
the IterationIDs to mark Pruned
Pruned
Decide which leaderboard entries should be pruned after a wave (plan §8.3 — "prune unpromising branches"). Two complementary rules, both optional:
bestScore * relativePruneThreshold.An entry pruned by either rule is returned. The set is deterministic (ranking is stable) and never prunes the single best entry.