Benjamin wrote: > > I have build just for fun a simple BackGammon engine. [...] > Interesting - did you also try it for chess, or do you think there's > no point in this?
This is a bit of speculation since I don't know enough about chess but I suspect that uniform random simulation in go is about as reliable an evaluation as a plain counting of piece values in chess, except that the latter comes without noise. So doing random simulations in chess would only make life more difficult, unless possibly if the simulation policy was really good. Doing UCT search instead of alpha-beta with some deterministic evaluation function might be an interesting experiment but I suspect alpha-beta is more efficient in that case. Othello seems like a better fit for UCT/MC and I suppose that has already been tested. /Gunnar _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
