RE: computer-go: Perl Module for next move.

[Matthew Corey Brown <bromoc@xxxxxxxxxxxxxxxxxx>]

A 3 layer(high node) neural network, The weights start off random, the
inputs are the board locations, 0 for empty, 1 for your color and -1 for
the opponent. The output is one value the current score (Not go
score, the score the net gives the board)  you take the orgional board
position then go through all possible moves to find a higher score. you
take the highest score move and use that on your turn. No higher scoor you
either pass or not. You start with some number of nets with randomized
values and have them all play eachother.. you total everyones score (this
time the Go score) then you take the top 50% scorers from that.. cross
breed them using genteic algorythms, and then apply mutations to each one.
 repeat the prosses for a long time. And after 1000 generations or so the
neural net may learn the game well enough.

would be interesting to see at which generation strategies begin to form.

theres a checker player program that used around 800 nodes and evolved the
same way thats real good from what i understand after about 7 weeks of
evolving on a pIII 400


On Fri, 1 Jun 2001, Grajdeanu, Adrian wrote:

> Amaizingly, I want to do the same thing...
> To analyze the table you use parts of the gnugo? If not, how do you solve
> it?
> 
> Adrian
> 
> 
> > I'm interested in giving a function the current board, then 
> > getting back
> > an array of answers either the resulting borad after dead peices are
> > removed or an illeagle move. Perl is needed cause I have a mishmash of
> > computer architechures to use Genetic algorythms to develop a neural
> > network to determine the best move at that moment. I want to watch the
> > computer develop its own stratagems.
> > 

Matthew Corey Brown                             bromoc@xxxxxxxxxxxxxxxxx 
  "Death can not stop true love. All it can do is delay it for awhile."