[computer-go] A nearest-neighbor heuristic

Stuart A. Yeates syeates at gmail.com
Thu Mar 8 01:45:56 PST 2007


On 3/8/07, Eduardo Sabbatella <eduardo_sabbatella at yahoo.com.ar> wrote:
> Oh! Great!
>
> Can you give us some info about it ?
> Are you using MC ?

I'm using static analysis of game records to build patterns of what
"good" moves look like. I have a compiled-regexp-like data-structure
which I'm using train to recognise good moves, but it could also be
represented as rules, in the manner Peter suggests.

cheers
stuart


More information about the computer-go mailing list