What type of study is this?

This is a Experimental Study study.

October 16, 2025Open Access

Study and improvement of search algorithms in two-players perfect information games

Key Points

A new search algorithm outperforms existing ones for short search times across all studied games.
For medium search times, the new algorithm outperforms others in 17 out of 22 two-player zero-sum games.
This work addresses a significant gap in evaluating the performance of search algorithms in game theory.
Artificial intelligence methods are crucial for enhancing the strategies in two-player perfect information games.

Abstract

Games, in their mathematical sense, are everywhere (game industries, economics, defense, education, chemistry, biology, ...).Search algorithms in games are artificial intelligence methods for playing such games. Unfortunately, there is no study on these algorithms that evaluates the generality of their performance. We propose to address this gap in the case of two-player zero-sum games with perfect information. Furthermore, we propose a new search algorithm and we show that, for a short search time, it outperforms all studied algorithms on all games in this large experiment and that, for a medium search time, it outperforms all studied algorithms on 17 of the 22 studied games.

Read Full Paperexternally

Mark Helpful

Bookmark

Relay

View Full Paper

Cite This Study

Quentin Cohen-Solal (Tue,) studied this question.

synapsesocial.com/papers/68f147cc724575985c3fd0f1 https://doi.org/https://doi.org/10.48550/arxiv.2505.09639