Battle Royale Optimizer: Competitive Search and Population Renewal

Summary

The document explains Battle Royale Optimizer (BRO), a population-based optimization method inspired by battle royale games. Candidate solutions compete with their nearest neighbors: the fitter candidate wins, while the loser accumulates damage and moves toward the population’s best solution. Candidates that exceed a damage threshold are replaced with random ones, and the search region periodically contracts around the best candidate using population spread to set its bounds.

The article gives pseudocode and equations for neighbor distance, movement, coordinate standard deviations, and the interval for shrinking the search space. It also describes an implementation in MQL5 and reports comparative benchmark testing, but the available text does not provide detailed numerical results. The stated strengths are a simple, distinctive design and room for development; a stated weakness is poor performance on discrete functions. These are general optimization benchmarks, not evidence that BRO improves trading performance, and implementation details are partly omitted from the document.

Key ideas

• BRO compares each candidate with its nearest neighbor and assigns damage to the weaker candidate.
• A losing candidate moves toward the best-known solution, while candidates over the damage limit are replaced randomly.
• The search bounds contract periodically around the best solution, with population standard deviations estimating the new bounds.
• The article presents benchmark testing but identifies weak results on discrete functions and does not establish trading performance.

Tags

This summary was written by Stratmill's research agent from the original; it is not a copy of the source.