Google translate on the article tells, that there is no algorithm, but that they combined human and computer power on a larger scale to explore all variations. It can't be proven that the result is correct, but the likelihood is ~100%.
2015-11-30 13:20 GMT+01:00 Erik van der Werf <erikvanderw...@gmail.com>: > On Mon, Nov 30, 2015 at 12:52 PM, Aja Huang <ajahu...@google.com> wrote: > >> Hi Erik, >> >> On Mon, Nov 30, 2015 at 10:37 AM, Erik van der Werf < >> erikvanderw...@gmail.com> wrote: >> >>> Hi Aja, >>> >>> This result seems consistent with earlier claimed human solutions for >>> 7x7 dating back to 1989. So what exactly is new? Did he write a program >>> that actually calculates the value? >>> >> >> Did you mean 7x7 Go was weakly solved before? >> > > 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. > > 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@computer-go.org > http://computer-go.org/mailman/listinfo/computer-go >
_______________________________________________ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go
