I tried it in my previous engine, which while probably littered with bugs, at least had the characteristic that more playouts lead to better play. This test
was extremely slow and produced a weaker bot. YYWV.
I'm 95% sure Don mentioned it on this list a couple of years ago, but I don't
know if he actually tried it.
Gian-Carlo Pascutto wrote:
On Wednesday 10 June 2009 18:48:55 Martin Mueller wrote:
Currently, we try to sidestep this fundamental problem by replacing
local search with local knowledge, such as patterns. But that does not
fully use the power of search.
So, has anyone tried recursive UCT (using UCT again in the playouts), and
what were the results? I saw some results for uninteresting games, but
nothing about Go.
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
