en-es
en-pt
en-sl
en
en-zh
en-de
en-fr
0.25
0.5
0.75
1.25
1.5
1.75
2
Coherent inference on optimal play in game trees
Published on 2010-06-033396 Views
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, they learn on-policy