Go problems don't work for MC programs unless you can arrange them so that finding the right move wins, and anything else loses. I found you can modify some problems by manipulating the komi to make this true.
- Don Yamato wrote: > Hi all. > > I'd like to share my test set for MC programs. > This is a gnugo-style "regression test" file. To use it, you need > to implement 2 GTP commands, loadsgf and reg_genmove. > Then, run your program like this: > > gnugo --mode gtp < mctest.tst | awk -f regress.awk tst=mctest.tst > > This set contains 50 problems. They are relatively easy to human > players and perhaps classic Go programs, but hard to MC programs. > > Here are my results. > > Zen-1.5 (1k playouts) : 15/50 > Zen-1.5 (10k playouts) : 20/50 > Zen-1.5 (100k playouts) : 22/50 > gnugo-3.7.10 (Level 0) : 22/50 > gnugo-3.7.10 (Level 10) : 32/50 > > I want to know the results of other programs. Please post here. > > -- > Yamato > ------------------------------------------------------------------------ > > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
