[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [computer-go] An [open] question on game tree search theory
Daniel Hallmark wrote:
May I ask a question?
Is there not a possibility that for a given game state t, some
percentage of G(t') are unrefutable wins for white, some are
unrefutable wins for black, and some can be fought to a draw?
Not in a game without a stochastic component. Go has no stochastic
component. Games with stochastic component like Backammon are different,
there the values of positions cannot be just "win" and "lose".
--
Antti Huima (Mr.)
Director, Conformiq Tools
mobile: +358 40 528 8667
email: antti.huima@xxxxxxxxxxxxxxxxx
Conformiq Software Ltd.
Stella Terra, Lars Sonckin kaari 16
FIN-02600 Espoo, Finland
tel: +358 10 286 6300
fax: +358 10 286 6309
http://www.conformiq.com/
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/