2 citations · 5 across the 11 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
Study and Improvement of Search Algorithms in Multi-Player Perfect-Information Games
Quentin Cohen-Solal
In this article, we generalize Unbounded Minimax, the state-of-the-art search algorithm for zero sums two-player games with perfect information to the framework of multiplayer game…
cs.GT2021
Completeness of Unbounded Best-First Game Algorithms
Quentin Cohen-Solal
In this article, we prove the completeness of the following game search algorithms: unbounded best-first minimax with completion and descent with completion, i.e. we show that, wit…