In message <[email protected]>, terry mcintyre
<[email protected]> writes
From: Olivier Teytaud <[email protected]>
do you think those are program-specific or a general problem with
UCT (or more likely the way simulations are run)?
Can you post a few specific cases?
Big easy semeais. Very clearly defined, so that they are trivial for
humans, and very big, so that there are many possible
permutations of liberties. One can clearly understand on this kind
of situations why UCT-like or MCTS-like algorithms
will not solve them.
Yes, I have observed cases of where an otherwise highly-skilled
UCT/MCTS program will fail, given large well-defined (to humans)
semeai.
There was such a semeai, misread by both players, in the last KGS bot
tournament. See the diagrams in
http://www.weddslist.com/kgs/past/57/index.html
Is there any way to do higher-level analysis of such semeais, in the
same manner as humans do, in order to correctly solve the problem with
fewer resources?
Maybe. But first, you need to be able to identify "large well-defined
(to humans) semeais".
Nick
--
Nick Wedd [email protected]
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
