There is a computer science topic called decision trees, which are used to map out all possible decisions and their results, and the next possible decisions and results after that, and so on. This is the method Deep Blue used to beat the world chess champion. There are lots of algorithms for minimizing the size of the tree, maximizing the quality
(
Read more... )