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

[Vincent Diepeveen <diep@xxxxxxxxx>]

Evaluation in backgammon is fairly simple and straight forward. The goal is
just so easy and your stones must keep moving quickly forward or you're
gonna lose for sure. You can easily calculate after a few throws already
your statistical chance of winning the game.

It's the statistical calculation and what you throw with the dices that
matters.

In fact if your statistical math is flawed but such that it supports the
random number generator you use, then how exact of a science is it?

Note there is random number special dedicated hardware which are pretty
expensive and used by several servers where you can play for money. 

Vincent

At 12:29 4-12-2004 +0100, Heikki Levanto wrote:
>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/
>
>
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/