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
Whatever its veracity, that result/writeup/claim is at least a couple
years old according to Wikipedia history.
https://fr.wikipedia.org/w/index.php?title=Hex&type=revision&diff=95162143&oldid=89914160
https://en.wikipedia.org/w/index.php?title=Hex_%28board_game%29&type=revision&diff=566436428&ol
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" wrote:
> > I have just been told by a colleague that Edoua
> 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 unrestrict
Hi,
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
I did not look at it in details, but it seems his method
https://github.com/pasky/iggsc2015proc
___
Computer-go mailing list
Computer-go@computer-go.org
http://computer-go.org/mailman/listinfo/computer-go
