[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [computer-go] Pattern matching - example play

On Sat, Dec 04, 2004 at 04:24:10AM +0100, Vincent Diepeveen wrote:
> 
> It is not a game tree search like go or chess are.

No, but among all the differences, there may well be a few similarities.

Backgammon has a huge branching factor that makes search difficult.
Evaluating backgammon positions is difficult (because of the statistical
nature of the game).

Go has a huge branching factor, and a difficult evaluation.

-H


-- 
Heikki Levanto   "In Murphy We Turst"     heikki (at) lsd (dot) dk

_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/