Seems like a silly title. Any game of perfect information that has a
clear rule set can be solved. Plus, some would argue that any Go
already is solved (write simple algorithm and wait 1 billion years
while it runs). A better question is, Can Computer Go Surpass Human
Go? But again, clearly
From http://senseis.xmp.net/?7x7BestPlay it looks like 7x7 Go
may already have been solved. 5x5 was solved in 2002, according
to http://erikvanderwerf.tengen.nl/5x5/5x5solved.html
AFAIK, 9x9 Go has not been solved yet. 19x19 Go will surely exceed the
capabilities of computers in my lifetime, I
A much more up-to-date bibliography is maintained by Markus Enzenberger:
http://www.cs.ualberta.ca/~emarkus/compgo_biblio/
Terry McIntyre
Bored stiff? Loosen up...
Download and play hundreds of games for
There are a number of definitions of solved, ranging from a program
exists that can beat any human to we can quickly determine, for any
position, the best move and the result under optimal play. In the
latter strong sense, I believe Go has only been solved up to 5x5,
maybe 6x6.
There are
Thank your for your response, Chris.
I think as Allis et al (1991, 1994) points out there is a difference in
'crackable' and 'solvable' where the former tend to be search-based
complexities and the later decision-based complexity. Irrespective of the
opponent via the cracking approach the best
Now there's an additional curiosity. The log of moves printed out by
the GNU Go twogtp.py script seems to sometimes insert gratuitous
passes or allow one player to play more than once in a row:
Black plays c9
White plays B9
Black plays d7
White plays D6
Black plays h6
White plays D4
White
Seems like a silly title. Any game of perfect information that has a
clear rule set can be solved. Plus, some would argue that any Go
already is solved (write simple algorithm and wait 1 billion years
while it runs). A better question is, Can Computer Go Surpass Human
Go? But again, clearly it
On 12-jan-07, at 14:16, Chris Fant wrote:
Plus, some would argue that any Go
already is solved (write simple algorithm and wait 1 billion years
while it runs).
To 'solve' a game in the strict sense you need to know the best
answer to every move. And you need to be able to prove that it's
And Mark Boon also neglected the future use of wormholes, replicators
and who knows what? :)
Sorry, but how do you what future quantum computers can churn so much
data?
10^400 is a rediculously large number. Even if you multiply the volume
of the visible universe expressed in in cubic Planck
yeah, there are upper limits placed on computation rate by thermodynamics.
19x19 is way beyond those as Dave pointed out. But, even if you believe
that technology will improve and the most revolutionary change yet will come
to understanding of physics and that change will give us signifigantly
Hi,
On 1/12/07, Nick Apperson [EMAIL PROTECTED] wrote:
yeah, there are upper limits placed on computation rate by thermodynamics.
19x19 is way beyond those as Dave pointed out. But, even if you believe
that technology will improve and the most revolutionary change yet will come
to
I appreciate your response. Mathematical solutions are certainly a good
possibility to reduce the amount of processing power needed. However, a
person would not be able to solve 19x19 because a person lacks the necessary
computational resources to form a solution in any reasonable amount of
Peter Drake wrote:
There are a number of definitions of solved, ranging from a program
exists that can beat any human to we can quickly determine, for any
position, the best move and the result under optimal play. In the
latter strong sense, I believe Go has only been solved up to 5x5,
maybe
White in 42 moves ;)
Have a good weekend everyone.
-Josh
that, a perfectly fair komi could be calculated. From what I know, even
chess is still unsolved conserning this matter - noone knows if white (or
even black) can force a win.
___
computer-go
I agree, anyone play othello/Reversi?
From my understanding it has been solved. Yet when I try to find info
on reversi computer tournaments they all seemed to die out several
years ago.
-Josh
On 1/12/07, Chrilly [EMAIL PROTECTED] wrote:
Besides the technical question if it is possible,
Another interesting question would be the score (eg. territorry) that
black/white can reach assuming perfect play on both sides. If we knew
that, a perfectly fair komi could be calculated. From what I know, even
chess is still unsolved conserning this matter - noone knows if white (or
even
In article [EMAIL PROTECTED], wrote:
Sorry, but how do you what future quantum computers can churn so much
data?
Chris Fant isn't a modern-day human but an android sent back
through a wormhole from future times (Future ^2, Left **7, Right **.13,
to the root of SQRT(-1) in hex
On Fri, 2007-01-12 at 15:43 -0600, Nick Apperson wrote:
yeah, there are upper limits placed on computation rate by
thermodynamics. 19x19 is way beyond those as Dave pointed out. But,
even if you believe that technology will improve and the most
revolutionary change yet will come to
On Fri, 2007-01-12 at 21:51 +, Vlad Dumitrescu wrote:
Hi,
On 1/12/07, Nick Apperson [EMAIL PROTECTED] wrote:
yeah, there are upper limits placed on computation rate by thermodynamics.
19x19 is way beyond those as Dave pointed out. But, even if you believe
that technology will
It looks like most of these games are being won in the opening. Doesn't
mogo have a big UCT opening book? Is it learning from each game it plays as
well?
David
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Don Dailey
Sent: Friday, January 12,
20 matches
Mail list logo
