[Computer-go] How many probes down the tree are necessary for a "good" bot?

Hiroshi Yamashita yss at bd.mbn.or.jp
Fri Nov 15 03:52:16 PST 2013


> it really isn't so much about that. The reason why strong programs
> have to consider very few moves is knowledge applied in the tree

I agree with you.

.OO.
OXXO     snap back
XO.O
.XO.

For example, Aya often took one "O" stone before. It is useless.
I added the feature "Take snap back when there is no ko", its gamma
 was 0.009, very low. After that, this move is rarely selected in tree.

Regards,
Hiroshi Yamashita




More information about the Computer-go mailing list