> These ideas are all old,
I never said they were new. I wanted to give a mathematical argument on
them.
What would have been new would have been methods with filters applied on
the \hat{p}_i. However, though I am pretty sure I could make them more
efficient with little data, that's certainly not the case with much
data. Now the question would be whether this could make better programs,
with work more or less on the leaves. That's something I cannot even
make suggestions on without real data and undertanding precisely what
the bot does (and much work).
> see for example "Old fashioned Computer Go
> vs Monte Carlo Go":
>
> http://ewh.ieee.org/cmte/cis/mtsc/ieeecis/tutorial2007/Bruno_Bouzy_2007.pdf
That's really interesting ! That's a whole directory of ideas ! Thank
you for the link !
At least my next one still seems to be original.
Jonas
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
