does not see a simple winning move
Issue #12
on hold
move 277
Comments (6)
-
reporter -
reporter If I turn of progressive widening it finds the move:(
Another example where the progressive widening is killing the move. I think I have to understand this concept in more detail, so I will read the papers first. Can you tell me the one you used for implementing?
-
reporter OK, I had a look into Remi's paper and into the implementation t(n+1)=t(n)+(a*b^n)*(1-c*p)
If I calculate this, is it correct, that we only look at the first 17 moves suggested by the playout heuristic, if I have 10000 simulations?!
Just to be sure I am understanding correctly...
-
repo owner - changed status to on hold
Your comment sounds about correct. This is a side-effect of using progressive unpruning/widening. I don't think there is currently an easy way to fix it.
-
repo owner - marked as enhancement
-
repo owner - removed responsible
- Log in to comment
winning move is j14 by the way:)