2008/7/21 Giorgio Bellegotti <[EMAIL PROTECTED]>:
>
> Above all, I find very intriguing the new Monte Carlo search method,
> even if I have a lot of doubts about it (if I have correctly understood
> it).
> I mean: trusting in statistical results can be very dangerous in chess
> (especially in endgames), very often there can be only one winning line,
> but it is enough to win the game, instead the Monte Carlo method could
> consider it as a draw line.
> Maybe, I'm missing something... maybe Monte Carlo search is only an
> addition to the normal evaluation, not a replacement.
>
Same thing for me. I don't get the point about playing thousands of bullet
games, and draw any conclusion from this.
It looks a bit like writing down the evaluation tree into several games, but
with some selective lines calculated as far as the end of the game : what is
the real difference with selective depth ?
The only advantage I see is that winning/losing lines are calculated with
statistics, and maybe the number of games compensates the fact that the
moves were calculated in 1 second ?
Pascal
-------------------------------------------------------------------------
This SF.Net email is sponsored by the Moblin Your Move Developer's challenge
Build the coolest Linux based applications with Moblin SDK & win great prizes
Grand prize is a trip for two to an Open Source event anywhere in the world
http://moblin-contest.org/redirect.php?banner_id=100&url=/
_______________________________________________
Scid-users mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/scid-users
