I think it would be useful to have a list of existing important heuristics / algorithms / ideas that improve Monte-Carlo Go. If you are aware of any that are not on this list please add them.
Lukasz Lew - MCTS / UCT - capture/atari heuristics in heavy playouts / mogo patterns http://hal.inria.fr/docs/00/12/15/16/PDF/RR-6062.pdf - harvested patterns with elo ratings http://remi.coulom.free.fr/Amsterdam2007/ - criticality heuristic http://remi.coulom.free.fr/Criticality/ - progressive bias / progrssive unprunning http://www.math-info.univ-paris5.fr/~bouzy/publications/CWHUB-pMCTS-2007.pdf - first play urgency + locality http://hal.inria.fr/docs/00/12/15/16/PDF/RR-6062.pdf _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
