[Computer-go] Scoring a go board.
remi.de.z at gmail.com
Fri Feb 8 13:33:28 PST 2013
surely at any time during a game of go, three passes can be made and the
game can be scored...
On 8 February 2013 22:31, Rémi <remi.de.z at gmail.com> wrote:
> If there really is a difference between (1) and (2) then I have always
> been completely oblivious to it. For your third (3) case I again see not
> what the difference is.
> On 8 February 2013 22:02, Nick Wedd <nick at maproom.co.uk> wrote:
>> On 08/02/2013 20:34, Rémi wrote:
>>> There are a lot of interesting papers on UCT and selection strategies
>>> ... But it's harder to find information about the more 'pragmatic' side
>>> of computer-go.
>>> How do you score a go board?
>> What do you mean by "score a go board"? I can think of three reasonable
>> (1.) Count the score in a game that is over.
>> (2.) Count the score in a game that is not over, but both players have
>> passed because they think it is.
>> (3.) Count the score in a game that is still being played.
>> (1) is difficult but practicable. (2) is similar to (1), so long as you
>> are not bothered about the result being meaningful, but just want to
>> calculate the score as a referee might if asked to score a game in which
>> both players have passed prematurely. (3) is as difficult as playing Go
>> What would be a faster algorithm to score a go-board?
>>> Could you pre-calculate and accumulate some information early in the
>>> game (on every move), knowing you're going to evaluate the board many
>>> When do you decide to finish/score the game?
>>> Also, what are some of the languages used besides C(++)? Does anyone
>>> work in something like java or a functional language?
>>> Rémi de Zoeten.
>>> Computer-go mailing list
>>> Computer-go at dvandva.org
>> Nick Wedd
>> nick at maproom.co.uk
>> Computer-go mailing list
>> Computer-go at dvandva.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Computer-go