On 22.01.2016 05:18, John Tromp wrote:
It's been a long journey, and now it's finally complete!
http://tromp.github.io/go/legal.html
Congratulations!
You must have needed 15 or 20 years of research to find the result?
Eventually you heavily rely on computational power. How has it been
possible to get hold of the computers and computation time? When
described in informal words, how have you attacked and proceeded with
the theory of the problem? What can other researchers learn from your
experience of how to research well? The number of legal positions itself
seems like a piece of trivia (is it?) but why do you think it is
important to have determined the number, that is, what is the research
benefit? If I may ask, what has been your motivation beyond curiosity?
You mention the calculation to be a server benchmark. Have there been
other equally or more suitable server benchmarks or is this particular
problem ground-breaking as a server benchmark?
What do the solution and its theory tell go players for tactics and
strategy and go programmers for developing better go playing programs?
Does the solution give a useful clue of how difficult it is to solve go
as a game weakly or strongly? That is, how is the number of legal
positions related to the computational complexity in time and space of
solving the 19x19 go game (under a given go ruleset) if viewed as the
specific 19x19 problem and not as the context of the general nxn
problem's class of computational complexity?
--
robert jasiek
_______________________________________________
Computer-go mailing list
Computer-go@computer-go.org
http://computer-go.org/mailman/listinfo/computer-go
