Completeness of Unbounded Best-First Minimax and Descent Minimax
arXiv:2603.24572v1 Announce Type: new
Abstract: In this article, we focus on search algorithms for two-player perfect information games, whose objective is to determine the best possible strategy, and ideally a winning strategy.
Unfortunately, some …