Re: [pbmserv] Yavalath puzzle

["Randall Bart" <barticus@att.net>]

> Hi,
> 
> Here is a Yavalath puzzle: X to play and win.
> 
>                 1 2 3 4 5
>                / / / / / 6
>                         / 7
>          a-  x . . . x   / 8
>         b-  . . . x o .   / 9
>        c-  . o . o . . .   /
>       d-  . . . x . . . .
>      e-  . o . . o . x . .
>       f-  . . o . x . . .
>        g-  . x x . . . .
>         h-  . o . . o x
>          i-  . o . . o
> 
> This puzzle is based on a game played with wghunter. I believe that X 
> has exactly one winning move and that all other moves lose quickly 
> (assuming that O plays optimally).
> 
> Can anyone prove or disprove this?

1.B2  2.C3(auto)                      X wins
1.G7  2.G6(auto)  3.B2  4.C3(auto)    X wins

Disproven.