Name
Abstract | ||
|---|---|---|
We present Online Evolution, a novel method for playing turn-based multi-action adversarial games. Such games, which include most strategy games, have extremely high branching factors due to each turn having multiple actions. In Online Evolution, an evolutionary algorithm is used to evolve the combination of atomic actions that make up a single move, with a state evaluation function used for fitness. We implement Online Evolution for the turn-based multi-action game Hero Academy and compare it with a standard Monte Carlo Tree Search implementation as well as two types of greedy algorithms. Online Evolution is shown to outperform these methods by a large margin. This shows that evolutionary planning on the level of a single move can be very effective for this sort of problems. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-31204-0_38 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Monte Carlo tree search,Evolutionary algorithm,Computer science,Turns, rounds and time-keeping systems in games,sort,Evolutionary computation,Evaluation function,Greedy algorithm,Evolution strategy,Artificial intelligence | Conference | 9597 |
ISSN | Citations | PageRank |
0302-9743 | 5 | 0.49 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Niels Justesen | 1 | 32 | 4.82 |
| Tobias Mahlmann | 2 | 85 | 7.99 |
| Julian Togelius | 3 | 2765 | 219.94 |