On Sun, Jun 27, 2010 at 08:49:57PM +0900, Darren Cook wrote:
> >> I guess moving to whole board patterns doesn't actually add much CPU,
> >> because they are only 3x3: a list of matching patterns can be
> >> maintained, and after each move only a few points need to be considered
> >> for new pattern matches.
> >
> > Yes, but then you need to choose from a probability distribution over
> > all the moves, which actually does slow things down *quite* a lot.
> > But apparently the slowdown is worth it.
>
> That is the Crazy Stone way? I imagined Fuego's way: just have a list of
> moves and choose one of them randomly.
Fuego does not check patterns over the whole board, just in the
neighborhood; it does consider defending/capturing all endangered groups
on the board, but it is easy to keep these lists incrementally and
process them quickly in a rule-based manner. CrazyStone needs to keep
"probabilities" of _all_ possible moves all the time and choose from all
of them.
Petr "Pasky" Baudis
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
