On Fri, 2007-01-12 at 16:39 -0600, Nick Apperson wrote: > The solution is a rule. It is only a matter of how easy that rule is > to apply. We have a rule that works now: Do a full min-max search on > every move and play the move that results in the highest expected > return given that your opponent is aiming for the lowest... Game > theory gives us that rule and we know it works for all games. We > might want a slightly more useful rule however. All rules require > computation, just to varying degrees while returning varying degrees > of correctness.
This is a good answer. This rule by itself is not feasible in a practical sense - but it always "works" and it yields the correct answer. - Don _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
