I post this question in the form of a problem whose
answer I don't know:
*Problem* : At the given position B loses by 5 pts. He
has only 1 winning move, which is winning a ladder. For
simplification he always has 25 legal moves. The ladder
is 20 ply deep. And, as it is the case with ladders, the
Quoting Jacques Basaldúa <[EMAIL PROTECTED]>:
*Question* : 1.How does MC/UCT find the correct answer
if the more you approach it (except if you hit it by a fluke),
the worse it evaluates?
It does not find the correct answer of long ladders in general. I think
the common behavior of a pure unif
