[pbmserv] Corrected Yavalath puzzle

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

> Here is a Yavalath puzzle: X to play and win.
> 
>                 1 2 3 4 5
>                / / / / / 6
>                         / 7
>          a-  . . . . 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-  x 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?

Well that's different.  O is threatening H7 (force H6) and I8 (force I7) to win.  Clearly X cannot stop this unless he moves G7, H7, or I8.  Analyzing those three paths is driving me nuts.