Le 19/11/2009 à 09:35, Seth Pellegrino a écrit : > > Hello all, > > I'm working on an implementation of Rémi Coulom's Elo-based move > prediction algorithm[1], and I seem to be running into efficiency > issues.
Very simple question to start: What is the programmation language ? Do you use 1d representation of the board (a list) or 2d ? 1d is much faster and i guess all efficient bots use it. You can have a look at "brown" random player (from G.Farneback) http://www.lysator.liu.se/~gunnar/gtp/brown-1.0.tar.gz it was built to provide gtp implementation, and legal random moves. my 2 cents. Alain _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
