[computer-go] A nearest-neighbor heuristic

[Eduardo Sabbatella]

Regex'like, pattern maching, a lot have been done on
this direction. The most complex pattern db / engine
is not good enough to beat the modest, simple MC
engine.

I'm sure you have some secrets under you arm ;-)

Fair enough

--- "Stuart A. Yeates" <syeates at gmail.com> escribió:

> 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
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
>
http://www.computer-go.org/mailman/listinfo/computer-go/
> 



	

	
		
__________________________________________________ 
Preguntá. Respondé. Descubrí. 
Todo lo que querías saber, y lo que ni imaginabas, 
está en Yahoo! Respuestas (Beta). 
¡Probalo ya! 
http://www.yahoo.com.ar/respuestas