학술

Study and Improvement of Search Algorithms in Stochastic Perfect-Information

arXiv CS.AI
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.

Abstract

In this article, we generalize Unbounded Minimax, the state- of-the-art search algorithm for deterministic zero-sum two- player games with perfect information to the framework of stochastic zero-sum two-player games with perfect informa- tion.

We experimentally show that this generalized algorithm achieves better performance than the main stochastic search algorithms.

관련 뉴스