[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [computer-go] Monte Carlo Go

On Friday, January 28, 2005, at 01:43  PM, Don Dailey wrote:


  1. Statistics are are gathered for each point for each player.  If
     it is hit more than once by the same player, it's not an issue
     and you count it as a single data point.

Ah, of course.


     If it is hit by both sides, count only the first player to hit
     it.  This makes sense as the data is far more relevant for the
     first player who plays to a given point.

Sounds reasonable.


  2. It doesn't make much sense to extend the list beyond the number
     of points on the board, so for example on a 9x9 board I assume
     there is an 81 element move list.  After annealing this list, you
     play on the first point possible.
Wouldn't this prevent snapbacks (or any other play onto a previously-occupied point)?

There were several ambiguious points in that paper.  However, I like
Bouzy's formulation of a very similar program which is described in a
paper called, "Developments on Monte Carlo Go."  Perhaps you've
already seen that one, but he seems to have taken the good ideas from
Monte Carlo Go and discarded the useless ones.

I'll have a look at this one.

Thanks,

Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/

_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/