[Computer-go] Scoring a go board.

"Ingo Althöfer" 3-Hirn-Verlag at gmx.de
Sat Feb 9 00:10:03 PST 2013

Hello Remi,

welcome in the computer-go mailing list.

One proposal: One of the few greatest guys here is Remi Coulom
(co-father of Monte Carlo tree search and also author of Crazy Star).
To avoid being mixed up with him I would propose that you call you
not simply "Remi" here but "Remi de Zoeten". As you see Remi calls
himself also by full name.

Cheers, Ingo.

-------- Original-Nachricht --------
> Datum: Fri, 8 Feb 2013 21:34:30 +0100
> Von: "Rémi" <remi.de.z at gmail.com>
> An: computer-go at dvandva.org
> Betreff: [Computer-go] Scoring a go board.

> Hy,
> 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 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 times?
> 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.

More information about the Computer-go mailing list