[computer-go] Experiments with UCT
Darren Cook
darren at dcook.org
Tue Jul 25 21:46:52 PDT 2006
> in yose, it seems like the following set of steps
> is mandatory to maintain a lead or to make up a
> small difference in lead:
>
> i) calculate the longest sequence of sente moves
> that improve your score, summing them along
> the way
> ii) calculate the largest gote move that improves
> your score
> iii) do i) and ii) from your opponent's point of
> view.
One issue that springs to mind is ko: sente moves are also ko threats,
so shouldn't always all be played before playing a gote move.
> i guess the short question is whether or not there
> is a good concept of sente and gote in anyone's
> code once yose is reached?
I personally think this is too hard to do accurately. Better to just try
all combinations of reasonable moves. (Or when "all" takes too long,
then a reasonable sample, as in monte-carlo go.)
Darren
More information about the computer-go
mailing list