Combining Scripted Behavior with Game Tree Search for Stronger, More Robust Game AI
نویسندگان
چکیده
Nicolas A. Barriga, Marius Stanescu, and Michael Buro [1 leave this spacer to make page count accurate] [2 leave this spacer to make page count accurate] [3 leave this spacer to make page count accurate] [4 leave this spacer to make page count accurate] [5 leave this spacer to make page count accurate] [6 leave this spacer to make page count accurate] [7 leave this spacer to make page count accurate] [8 leave this spacer to make page count accurate] [9 leave this spacer to make page count accurate] [10 leave this spacer to make page count accurate] [11 leave this spacer to make page count accurate] [12 leave this spacer to make page count accurate] [13 leave this spacer to make page count accurate] [14 leave this spacer to make page count accurate] [15 leave this spacer to make page count accurate] [16 leave this spacer to make page count accurate] [17 leave this spacer to make page count accurate] [18 leave this spacer to make page count accurate] [19 leave this spacer to make page count accurate] [20 leave this spacer to make page count accurate]
منابع مشابه
Adapting in-game agent behavior by observation of players using learning behavior trees
In this paper we describe Learning Behavior Trees, an extension of the popular game AI scripting technique. Behavior Trees provide an effective way for expert designers to describe complex, in-game agent behaviors. Scripted AI captures human intuition about the structure of behavioral decisions, but suffers from brittleness and lack of the natural variation seen in human players. Learning Behav...
متن کاملA Hybrid Artificial Intelligence Approach with Application to Games
We describe a hybrid Artificial Intelligence (AI) approach combining soft AI techniques (neural networks) and hard AI methods (alpha-beta game tree search), in an attempt to approximate human play more accurately, in particular with reference to the game of Go. The program is tested and analysed by play against another Go playing program and it is shown that the use of hard AI enhances the perf...
متن کاملPuppet Search: Enhancing Scripted Behavior by Look-Ahead Search with Applications to Real-Time Strategy Games
Real-Time Strategy (RTS) games have shown to be very resilient to standard adversarial tree search techniques. Recently, a few approaches to tackle their complexity have emerged that use game state or move abstractions, or both. Unfortunately, the supporting experiments were either limited to simpler RTS environments (μRTS, SparCraft) or lack testing against state-of-the-art game playing agents...
متن کاملUsing Intelligent Search Techniques to Play the Game Khet
This paper describes the analysis of the game Khet and the implementation of a game engine. Both the state-space complexity and the game-tree complexity of Khet are given. They turn out to be of the same order as those of chess. Based on these results, search techniques are selected that can be used to create an AI player which can play Khet as good as possible. These search techniques are impr...
متن کاملIntegrating Monte Carlo Tree Search with Knowledge-Based Methods to Create Engaging Play in a Commercial Mobile Game
Monte Carlo Tree Search (MCTS) has produced many recent breakthroughs in game AI research, particularly in computer Go. In this paper we consider how MCTS can be applied to create engaging AI for a popular commercial mobile phone game: Spades by AI Factory, which has been downloaded more than 2.5 million times. In particular, we show how MCTS can be integrated with knowledge-based methods to cr...
متن کامل