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...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on computational intelligence and AI in games. Ročník 2; číslo 4; s. 271 - 277
Hlavní autoři:	Méhat, Jean, Cazenave, Tristan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	IEEE 01.12.2010
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!