Combining UCT and Nested Monte Carlo Search for Single-Player General Game Playing

Monte Carlo tree search (MCTS) has been recently very successful for game playing, particularly for games where the evaluation of a state is difficult to compute, such as Go or General Games. We compare nested Monte Carlo (NMC) search, upper confidence bounds for trees (UCT-T), UCT with transpositio...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on computational intelligence and AI in games. Jg. 2; H. 4; S. 271 - 277
Hauptverfasser:	Méhat, Jean, Cazenave, Tristan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 01.12.2010
Schlagworte:	Algorithm design and analysis Artificial intelligence Classification algorithms Competition Computer simulation Decision trees Games General Game Playing (GPP) Monte Carlo methods nested Monte-Carlo search Searching single-player games Tables Trees upper confidence bounds for trees (UCT)
ISSN:	1943-068X, 1943-0698
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!