Answers are grounded in this paper and cite their sources.
Metaheuristic optimization algorithms are powerful numerical tools for solving complex, high-dimensional problems. Population-based by design, they seek near-optimal solutions efficiently. Owing to their flexibility, metaheuristic algorithms are applicable across a wide range of optimization tasks. However, one of the key challenges they face is handling multi-dimensional functions. Numerous algorithms have been proposed to date, competing on speed, accuracy, and robustness. In this paper, several existing optimization algorithms are first reviewed. Then, a novel optimization algorithm inspired by the chess game is introduced, to predict the global optimum more accurately and efficiently. Various tuning parameters are proposed to adapt the algorithm to specific problems, enhancing both convergence speed and accuracy. A comparative evaluation against established methods shows that the proposed Chess Optimization (CHESS) algorithm is competitive in robustness, accuracy, and speed on the benchmark problems considered. These results are demonstrated on four representative benchmark functions with five independent runs per algorithm; extending the evaluation to larger-scale benchmark suites is discussed as future work.
No takes yet. Share an insight, caveat, or question.
Behzadi et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: