 Date: 2009-04-20 18:54:11Search algorithms Game artificial intelligence Combinatorial optimization Routing algorithms Data types Minimax A* search algorithm Monte Carlo method Tree traversal UCT Tree Monte Carlo tree search | |  Bandit based Monte-Carlo Planning Levente Kocsis and Csaba Szepesv´ari Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende u, 1111 Budapest, Hungary
Add to Reading ListSource URL: ggp.stanford.eduDownload Document from Source Website File Size: 327,68 KBShare Document on Facebook
|
