DocumentCode
3683550
Title
An experimental study of action selection mechanisms to create an entertaining opponent
Author
Nick Sephton;Peter I. Cowling;Nicholas H. Slaven
Author_Institution
York Centre for Complex Systems Analysis, Department of Computer Science, University of York, United Kingdom
fYear
2015
Firstpage
122
Lastpage
129
Abstract
The final step in the Monte Carlo Tree Search algorithm is to select the action to play from the root level of the tree. Experimentation on modifying the selection mechanism has been somewhat limited to date, particularly with respect to consider aspects other than playing strength. This paper investigates the modification of selection mechanism as an attempt to produce a more entertaining opponent in the strategic card game Lords of War. These selection mechanisms are played against our most effective Information Set MCTS agent, and we investigate their performance in terms of measures of performance and complexity. An interesting side effect is that one of the action selection mechanisms results in a significant improvement in ISMCTS play strength. We also experiment with online tuning of configuration parameters in an attempt to create an agent with dynamically scaling play strength.
Keywords
"Games","Robustness","Complexity theory","Artificial intelligence","Monte Carlo methods","Tuning","Estimation"
Publisher
ieee
Conference_Titel
Computational Intelligence and Games (CIG), 2015 IEEE Conference on
ISSN
2325-4270
Electronic_ISBN
2325-4289
Type
conf
DOI
10.1109/CIG.2015.7317939
Filename
7317939
Link To Document