On Thursday 11 June 2009 13:16:42 Magnus Persson wrote: > Would this be a simple way of using many cores effectively?
I don't see what it has to do with multiprocessing. > Otherwise I cannot see how recursive UCT would be anything else than > an ineffective implementation of UCT. Unless it provides some > information that could be used more effectively than with normal search. It would improve the quality of the playouts (the evaluation). The closest thing I know would be internal iterative deepening in chess. If you don't know what the best move is, and you need to know to get good move ordering and an efficient search, you just call search recursively with half the depth. Basically, you would run UCT as normal at the top level, and in the playouts, use UCT with a small node limit. The UCT-guided playouts will avoid many cases of badly resolved semeai, and this in turn guides the top level UCT search better. Of course coming up with a vague idea is one thing, getting it to work is another matter :) But it's where I would look to solve the "brick wall"/"bias" issue with current playouts. -- GCP _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
