computer-go: Seki

["Jeff Massung" <jmassung@xxxxxxxxxxx>]

Okay, seki question:

Consider the following two board setups:

1.
XXOXX
XOOXX
XOXXX
XOOab
.XOOO
..XXO
....X

2.
OXaOOXO
OXbOXXO
OXXXXOO
OOOOO..

Where X = Black, O = White, a/b = considered spaces to move, . = empty 
space, and both setups are are on the edges of the board.

I know from book reading that the first setup is definitely seki, and that 
the second is not, because is White plays at 'a' it can kill the black group 
(leaving it only the 4 liberties inside).

My question is this:  are both setups "seki" until white plays at 'a' (in 
the second setup), and what is the "proof" (in algorithm form) that says 
that 1 is seki and 2 isnt (if 2 definitely is not seki).

Thanks again!

Jeff
______________________________________________________
Get Your Private, Free Email at http://www.hotmail.com