In message
<[EMAIL PROTECTED]>,
[EMAIL PROTECTED] writes
< Hawaiian shirt analogy snipped >
>I hope you don't feel offended. Indeed you took up a wonderful
>endeavour, but I sense that you're not quite ready to go for the summit
>today.
But Tony never expressed any interest in "going for the summit". Maybe
he just wants to write a simple MC implementation. Here is what he
wrote:
>I am new to programming go, could some one explain to me how a monte
>carlo based evalution manages to play random games by itself?
>ie: who/what is the oppoent which supplies the opposing moves which
>allows another move to be randomly played after making the initial move
>at the root.
>I am implementing in java, is there a package/framework which allows me
>to train my software.
I will try to answer these questions myself.
> who/what is the oppoent which supplies the opposing moves
It is the same piece of your program that supplies your own moves. For
each "random game" or "rollout", your program places both black and
white stones, alternately, at random.
>is there a package/framework which allows me
>to train my software.
Nothing "trains" your software. This isn't a neural net. The way it
works is:
you write a program
A: it plays, badly
you modify it so it plays differently, and with luck, better
repeat from A
Nick
--
Nick Wedd [EMAIL PROTECTED]
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
