Monte Carlo tree search: A review of recent modifications and applications
Abstract Monte Carlo Tree Search (MCTS) is a powerful approach to designing game-
playing bots or solving sequential decision problems. The method relies on intelligent tree …
playing bots or solving sequential decision problems. The method relies on intelligent tree …
[图书][B] Artificial intelligence and games
GN Yannakakis, J Togelius - 2018 - Springer
Georgios N. Yannakakis Julian Togelius Page 1 Artificial Intelligence and Games Georgios N.
Yannakakis Julian Togelius Page 2 Artificial Intelligence and Games Page 3 Georgios N …
Yannakakis Julian Togelius Page 2 Artificial Intelligence and Games Page 3 Georgios N …
Combinatorial multi-armed bandits for real-time strategy games
S Ontanón - Journal of Artificial Intelligence Research, 2017 - jair.org
Games with large branching factors pose a significant challenge for game tree search
algorithms. In this paper, we address this problem with a sampling strategy for Monte Carlo …
algorithms. In this paper, we address this problem with a sampling strategy for Monte Carlo …
SCC: An efficient deep reinforcement learning agent mastering the game of StarCraft II
AlphaStar, the AI that reaches GrandMaster level in StarCraft II, is a remarkable milestone
demonstrating what deep reinforcement learning can achieve in complex Real-Time …
demonstrating what deep reinforcement learning can achieve in complex Real-Time …
A review of computational intelligence for StarCraft AI
After artificial intelligent (AI) scientists have conquered Go game, StarCraft has been the next
biggest challenge. A highly intelligent AI system that is able to beat human professional …
biggest challenge. A highly intelligent AI system that is able to beat human professional …
Adversarial hierarchical-task network planning for complex real-time games
S Ontanón, M Buro - Proceedings of the 24th International Conference …, 2015 - dl.acm.org
Real-time strategy (RTS) games are hard from an AI point of view because they have
enormous state spaces, combinatorial branching factors, allow simultaneous and durative …
enormous state spaces, combinatorial branching factors, allow simultaneous and durative …
Show me the way! Bilevel search for synthesizing programmatic strategies
DS Aleixo, LHS Lelis - Proceedings of the AAAI Conference on Artificial …, 2023 - ojs.aaai.org
The synthesis of programmatic strategies requires one to search in large non-differentiable
spaces of computer programs. Current search algorithms use self-play approaches to guide …
spaces of computer programs. Current search algorithms use self-play approaches to guide …
Combining strategic learning with tactical search in real-time strategy games
N Barriga, M Stanescu, M Buro - … of the AAAI Conference on Artificial …, 2017 - ojs.aaai.org
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 …
is to use action and/or state abstractions. High-level abstractions can often lead to good …
The first microrts artificial intelligence competition
This article presents the results of the first edition of the microRTS (μRTS) AI competition,
which was hosted by the IEEE Computational Intelligence in Games (CIG) 2017 conference …
which was hosted by the IEEE Computational Intelligence in Games (CIG) 2017 conference …