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

["Mark Boon" <tesuji@xxxxxxxxx>]

There are programs that use such heuristics, yes.

To the answer whether seki is 'solved', I seriously doubt it's solved
theoretically and definitely not by a program. There are situations that
look like seki, until one of the sides plays multiple-suicide to win. I'm
pretty sure no existing program actually even 'tries' suicide moves.

> -----Original Message-----
> From: computer-go-bounces@xxxxxxxxxxxxxxxxx
> [mailto:computer-go-bounces@xxxxxxxxxxxxxxxxx]On Behalf Of Frank de Groot
> Sent: Wednesday, November 03, 2004 10:47
> To: computer-go
> Subject: Re: [computer-go] Is seki problem solved ?
>
>
> From: "hspark" <hspark@xxxxxxxxxxxxxxxxx>
> Subject: [computer-go] Is seki problem solved ?
>
>
> > 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.
>
>
> I have also a question about Seki.
> There are Go books for beginners in which Seki is explained.
> Do current Go programs use the heuristics explained in such books?
>
> _______________________________________________
> 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/