2017
DOI: 10.1007/978-3-319-55849-3_26
|View full text |Cite
|
Sign up to set email alerts
|

Evolving Game-Specific UCB Alternatives for General Video Game Playing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
3
2
1

Relationship

4
2

Authors

Journals

citations
Cited by 16 publications
(20 citation statements)
references
References 18 publications
0
20
0
Order By: Relevance
“…In a different study, Khalifa et al [31] applied multi-objective concepts to evolving parameters for a tree selection confidence bounds equation. A previous work by Bravi [32] (also discussed in Section IV-D) provided multiple UCB equations for different games. The work in [31] evolved, using S-Metric Selection Evolutionary Multi-objective Optimization Algorithm (SMS-EMOA), the linear weights of a UCB equation that results of combining all from [32] in a single one.…”
Section: B Tree Search Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…In a different study, Khalifa et al [31] applied multi-objective concepts to evolving parameters for a tree selection confidence bounds equation. A previous work by Bravi [32] (also discussed in Section IV-D) provided multiple UCB equations for different games. The work in [31] evolved, using S-Metric Selection Evolutionary Multi-objective Optimization Algorithm (SMS-EMOA), the linear weights of a UCB equation that results of combining all from [32] in a single one.…”
Section: B Tree Search Methodsmentioning
confidence: 99%
“…Evolution and MCTS have also been combined in different ways. In one of them, Bravi et al [49] used a GP system to evolve different tree policies for MCTS. Concretely, the authors evolve a different policy for each one of the 5 games employed in the study, aiming to exploit the characteristics of each game in particular.…”
Section: Hybridsmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, Bravi el al. [19] custom various heuristics particularly for some GVGAI games, and Sironi el al. [20] design several Self-Adaptive MCTS variants which use hyperparameter optimisation methods to tune on-line the exploration factor and maximal roll-out depth during the game playing.…”
Section: B Monte Carlo Tree Search-based Agentsmentioning
confidence: 99%
“…In this work, each pair of agents is tested over 20 playthroughs The GPMCTS agent is an MCTS agent with customisable Tree Policy as described in [19].…”
Section: Experimental Set-upmentioning
confidence: 99%