RE: [computer-go] Is seki problem solved ?

["David Fotland" <fotland@xxxxxxxxxxxxxxx>]

Simple seki can be statically recognized.  Many Faces has static bounds on
the maximum and minimum number of total liberties, shared liberties, and
eyes for each group.  In many cases these bounds can prove a seki.  In other
cases they can prove that one of the two groups must get at least a seki,
and in some cases reading is required.

David

> -----Original Message-----
> From: computer-go-bounces@xxxxxxxxxxxxxxxxx 
> [mailto:computer-go-bounces@xxxxxxxxxxxxxxxxx] On Behalf Of hspark
> Sent: Wednesday, November 03, 2004 8:19 PM
> To: jasiek@xxxxxxxxxxxxxxxxx; computer-go
> Subject: Re: [computer-go] Is seki problem solved ?
> 
> 
> Sorry.
> 
> The seki problem is seki.
> 
> My question is the general solution of seki in computer Go.
> 
> Is there a solution , static or dynamic evalution function?
> 
> hspark.
> 
> 
> ----- Original Message ----- 
> From: "Robert Jasiek" <jasiek@xxxxxxxxxxxxxxxxx>
> To: "computer-go" <computer-go@xxxxxxxxxxxxxxxxx>
> Sent: Wednesday, November 03, 2004 9:36 PM
> Subject: Re: [computer-go] Is seki problem solved ?
> 
> 
> > 
> > 
> > 
> > hspark wrote:
> > > Is seki problem solved ?
> > > 
> > > I read the paper which is written "Completely characterizing 
> > > single-group seki-related values" in EYESPACE VALUES IN GO by 
> > > landman.
> > 
> > What do you mean by your question?
> > What do you mean by the "seki problem"?
> > 
> > --
> > robert jasiek
> > 
> > 
> > _______________________________________________
> > computer-go mailing list
> > computer-go@xxxxxxxxxxxxxxxxx 
> > http://www.computer-go.org/mailman/listinfo/computer-go/
> > 
> 


_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/