[computer-go] MC approach (was: Monte Carlo (MC) vs Quasi-Monte Carlo (QMC))

Don Dailey drd at mit.edu
Wed Feb 7 10:28:00 PST 2007


On Wed, 2007-02-07 at 11:34 +0100, Heikki Levanto wrote:
> 
> All this could be avoided by a simple rule: Instead of using +1 and -1
> as the results, use +1000 and -1000, and add the final score to this.

Heikki,

I've tried ideas such as this in the past and it's quite
frustrating - everything that tries to take territory
scoring into account weakens the program.  

If you just need to see prettier moves,  I think it is
good enough to priortize the moves using some other
algorithm at the root of the tree.   If you just cover
the case where a program is "easily winning" or losing
it will play "nicer" but not stronger.

- Don




More information about the computer-go mailing list