Study and improvement of search algorithms in two-players perfect information games

Games, in their mathematical sense, are everywhere (game industries, economics, defense, education, chemistry, biology, ...).Search algorithms in games are artificial intelligence methods for playing such games. Unfortunately, there is no study on these algorithms that evaluates the generality of their performance. We propose to address this gap in the case of two-player zero-sum games with perfect information. Furthermore, we propose a new search algorithm and we show that, for a short search time, it outperforms all studied algorithms on all games in this large experiment and that, for a medium search time, it outperforms all studied algorithms on 17 of the 22 studied games.

@article{cohen-solal2025_2505.09639,
  title={ Study and improvement of search algorithms in two-players perfect information games },
  author={ Quentin Cohen-Solal },
  journal={arXiv preprint arXiv:2505.09639},
  year={ 2025 }
}