[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [computer-go] Computer Go tournament at EGF

In message <20050215032902.53225.qmail@xxxxxxxxxxxxxxxxx>, steve uurtamo <apoxonpoo@xxxxxxxxxxxxxxxxx> writes
It has been shown
that it would take
longer than the duration of the universe to perform
the search, even
if there were enough storage.

in the interests of keeping this somewhat practical
for the list, does anyone know if go is a game
*with* a solution?

i.e. is there a deterministic, bounded-time algorithm
to determine that a board position is "finished"?  at
least the way that i and other players i've played
with
play go, it's not clear that there is or might be such
an algorithm.  (two consecutive passes before a game
is considered over).
There is no such algorithm.

Knowing whether this is all my territory, or whether my opponent's group inside it has a way to live, is difficult.

if there is such an algorithm (someone posted a link
a few days ago to an 'am i playing inside my own
territory' algorithm, which is part of what i'm
talking about here, but i'm not sure if that
would answer the question in its entirety), then
clearly there are a specific number of 'finished'
games, a (larger?) number of games 1 move away from
being finished, etc. all the way back to no stones
on the board.

has anyone read this, or know the answer?

thanks in advance,

Nick
--
Nick Wedd    nick@xxxxxxxxxxxxxxxxx
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/