[computer-go] .. if Monte-Carlo programs would play infinitestrong
steve uurtamo
apoxonpoo at yahoo.com
Mon Nov 27 11:31:32 PST 2006
> I guess you would simply steer towards positions
> where the computer had
> lot's of "good" moves and the opponent had very few
> "good" moves.
this is essentially the same thing -- if you play
in a branch where the highest percentage of moves
lead to a win for you, then this means that your
opponent has less opportunities to play a winning
move. any error whatsoever leads to a loss for them.
this doesn't mean that your opponent would have
difficulty choosing a correct move at many of the
tree's nodes, but certainly they would not know the
full tree, and could only eliminate *most* of the
imperfect moves.
some of these would be very straightforward to
prevent, but some would not. for instance, you
might be willing to include branches that led to
draws. draws in go could be very tricky to prevent
at the same time as trying to win.
s.
____________________________________________________________________________________
Sponsored Link
Mortgage rates near 39yr lows.
$510k for $1,698/mo. Calculate new payment!
www.LowerMyBills.com/lre
More information about the computer-go
mailing list