Being pspace complete would just make the method impracticably slow for a sufficiently large board size.
The searches in such a case will be exponential in board size and not be very interesting. s. On Jul 28, 2015 6:59 AM, "John Tromp" <john.tr...@gmail.com> wrote: > > I have just been told by a colleague that Edouard Rodrigues solved hex > mathematically. I was very surprised because I had never heard about it. > > > > The web site with the proof and optimal strategy is there: > > http://jeudhex.com/?page_id=17 > > Perhaps he found a winning strategy for an unrestricted first player? > The game with the usual swap rule doesn't feel to me like it would submit > to > an efficiently computable strategy. > > > I did not look at it in details, but it seems his method can find an > optimal move on any position and any board size. > > That's most unlikely, considering that HEX is PSPACE complete... > > -John > _______________________________________________ > 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
