> I've attached a 9x9 game; a complex game that ended in a 2.5pt win for
> white (at 5.5pt komi).
To save you opening the sgf, here is the terminal position:
A B C D E F G H J
9 . . . . . . O O O 9
8 . O # O O O O # # 8
7 O O # O # # O O # 7
6 # O O # . . # # # 6
5 # # O # # # . # # 5
4
I've attached a 9x9 game; a complex game that ended in a 2.5pt win for
white (at 5.5pt komi).
When I run random playouts on the terminal position (at 6.5pt komi, so
actually W+3.5) the results are surprising. With 20 playouts black wins
9. When I increase to 1000 playouts black wins 564.
I assume
I enjoy perl so it would be nice to see your program. Can you email me
a URL or attach the source once you release it?
-Josh
On 4/17/07, dan <[EMAIL PROTECTED]> wrote:
Hi,
I have written a perl program that plays Go (poorly).
It uses pattern matching. Patterns are automatically read into a dat
Remi Munos wrote:
> .. only when the tree is very smooth, ie. when the branches that
> appear good (from obtained rewards so far) are actually good and
> the branches that appear bad are truly bad.
Go is a territorial game. I.e. an accumulative game, therefore
when you loose territory you could
