2 citations · 5 across the 11 of their papers we have counts for
1 paper · 1 filter
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…