[computer-go] Monte Carlo challenge: ladders

[Peter Drake]

To those of you with Monte Carlo programs:

Consider this board configuration:

.........
..ww.....
.wBBw....
..wBBw...
...w.....
.........
......B..
.........
.........

I believe black's best move is to play in the center and escape via  
the broken ladder.

1) Is this true? (This is a Go-playing question.)

2) Can your program find this move (and decide that it's not a good  
move if the ladder-breaker is missing)?

3) If so, how many runs does it take?

4) With fewer runs, what does the program do? If there is no ladder  
breaker, does the program think the ladder works until it has read it  
to the end?

I'm having a devil of a time getting my program to solve this one,  
and I'm wondering if I just picked an extremely hard problem.

Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/




-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://computer-go.org/pipermail/computer-go/attachments/20061102/3b00a203/attachment.htm