That drives me nuts! Minimax search would eliminate bad lines of play whenever
a refutation is found. A good opponent would not play badly, and the quantity
of possible bad moves should not affect the evaluation of good moves - but that
seems to be what MC does, averaging out all moves regardless of whether they
are known to be good, have been refuted, or are of indeterminate status.
What am I missing?
Terry McIntyre
----- Original Message ----
From: Nick Apperson <[EMAIL PROTECTED]>
If it only did one playout you would be right, but imagine the following cases:
case 1: White wins by .5 x 100, Black wins by .5 x 100
case 2: White wins by 100.5 x 91, Black wins by .5 x 109
the method that takes into account score would prefer the second case even
though it has a lower winning percentage that may be represented by the fact
that white is making an overplay for instance. Obviously this is just one
example, but there are many cases like this and overplays tend to be
priveledged in a sense I would suspect with this kind of algorithm.
- Nick
____________________________________________________________________________________
Get your own web address.
Have a HUGE year through Yahoo! Small Business.
http://smallbusiness.yahoo.com/domains/?p=BESTDEAL
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
