cs.AINov 18, 2026

Study and Improvement of Search Algorithms in Stochastic Perfect-Information

Authors: Quentin Cohen-Solal, Tristan Cazenave

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.

Figures & tables

Explore similar work

CardsList
  1. Study and Improvement of Search Algorithms in Multi-Player Perfect-Information Games

    Apr 19, 2026Quentin Cohen-SolalGame-Playing AgentsTree Search

  2. Completeness of Unbounded Best-First Minimax and Descent Minimax

    Mar 25, 2026Quentin Cohen-SolalGame-Playing AgentsTree Search

  3. Decentralized Best-Response-Based Learning in Two-Player Zero-Sum Stochastic Games: A Finite-Sample Analysis

    Sep 2, 2024Zaiwei Chen, Kaiqing Zhang, Eric Mazumdar +2Nash EquilibriumGame Theory