Thanks for your feedback.
Yes, it seems the strategy is only for an unrestricted first player.
I looked at the web site more carefully. It seems to present only the
main result. The full document is not available online, only its table
of contents:
http://jeudhex.com/?page_id=231
So it looks like 2391+ pages of hand-made proof. I don't feel like
checking it any more ;-)
Still an impressive result if it is correct.
Rémi
On 07/28/2015 03:58 PM, John Tromp 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
