[Computer-go] 7x7 Go is weakly solved

[Aja Huang]

On Mon, Nov 30, 2015 at 12:20 PM, Erik van der Werf <
erikvanderwerf at gmail.com> wrote:
>
> It depends on what you mean by 'weakly solved'. If we take the definition
> from https://en.wikipedia.org/wiki/Solved_game:
>
> *'Provide an algorithm that secures a win for one player, or a draw for
> either, against any possible moves by the opponent, from the beginning of
> the game.'*
>
> then no, I did not mean that, and that's why I asked you if he actually
> wrote a program that does this for 7x7.
>

By 'weakly solved' I just directly translated his claim in the Chinese
article. From the text it's not very clear to me whether he actually wrote
a program. Looks like he didn't write a program and he solved it by
mathematical proof with his Go knowledge since he is a pro.

Aja


> Strong humans players including some pro's claimed to have solved 7x7
> already back in 1989 (see my phd thesis for a reference), but AFAIK they
> did not implement an algorithm, so just like most of the other small board
> results by humans these were never really proofs in a strict sense.
>
> Best,
> Erik
>
>
> _______________________________________________
> Computer-go mailing list
> Computer-go at computer-go.org
> http://computer-go.org/mailman/listinfo/computer-go
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://computer-go.org/pipermail/computer-go/attachments/20151130/13b9cf6f/attachment.html>