paper-with-me

홈 › Papers

Domain-Independent Game Abstraction using Word Embedding Techniques

2026-05-15 · Juho Kim, Tuomas Sandholm arxiv

Many games of interest in the real world are often intractably large, thereby necessitating the use of game abstraction to shrink them in size, typically by many magnitudes. Over the last two decades, there have been significant advances in game abstraction; however, the domain-specific nature (usually poker) of much of the prior work prevents those techniques from being easily generalized to other settings without extensively analyzing the game at hand. In this paper, we propose a domain-independent approach to game abstraction, which applies word embedding techniques from the field of natural language processing. Treating each action as a word and gameplay data as a corpus, word vectors can be trained to represent each action as a real-valued vector, which can then be clustered to facilitate game abstraction. We also explore the use of foundational embedding models and show that action embeddings obtained this way can capture a surprising amount of information about the underlying game. Experimental results demonstrate that our proposed game abstraction technique is effective, although it does not outperform specialized algorithms tailored to specific games.

📄 PDF Abstract BibTeX arXiv:2605.15543

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

No-Regret Strategy Solving in Imperfect-Information Games via Pre-Trained Embedding

2025-11-15 · Yanchang Fu, Shengda Liu, Pei Xu, Kaiqi Huang arxiv

High-quality information set abstraction remains a core challenge in solving large-scale imperfect-information extensive-form games (IIEFGs)--such as no-limit Texas Hold'em--where the finite nature of spatial resources h…

Elastic Monte Carlo Tree Search with State Abstraction for Strategy Game Playing

2022-05-30 · Linjie Xu, Jorge Hurtado-Grueso, Dominic Jeurissen, Diego Perez Liebana 외

Strategy video games challenge AI agents with their combinatorial search space caused by complex game elements. State abstraction is a popular technique that reduces the state space complexity. However, current state abs…

Hierarchical Width-Based Planning and Learning

2021-01-15 · Miquel Junyent, Vicenç Gómez, Anders Jonsson

Width-based search methods have demonstrated state-of-the-art performance in a wide range of testbeds, from classical planning problems to image-based simulators such as Atari games. These methods scale independently of …

Atari Games

Deep Counterfactual Regret Minimization

2018-11-01 · Noam Brown, Adam Lerer, Sam Gross, Tuomas Sandholm

Counterfactual Regret Minimization (CFR) is the leading framework for solving large imperfect-information games. It converges to an equilibrium by iteratively traversing the game tree. In order to deal with extremely lar…

counterfactual

Combining Strategic Learning and Tactical Search in Real-Time Strategy Games

2017-09-11 · Nicolas A. Barriga, Marius Stanescu, Michael Buro

A commonly used technique for managing AI complexity in real-time strategy (RTS) games is to use action and/or state abstractions. High-level abstractions can often lead to good strategic decision making, but tactical de…

Decision MakingReal-Time Strategy Games