Generalizes Unbounded Minimax to multiplayer perfect-information games and experimentally shows superior performance over main existing algorithms.
Best- first minimax search.Artificial intelligence, 84(1- 2):299–337
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Study and Improvement of Search Algorithms in Multi-Player Perfect-Information Games
Generalizes Unbounded Minimax to multiplayer perfect-information games and experimentally shows superior performance over main existing algorithms.