"near infinite"
the set of all possible chess games is most definitely finite, and computable. never said deep blue was unbeatable, just what it's strategy was -- it's entirely possible to be driven into a region of the tree having no winning results
You said,
it calculated the entire tree of all possible games and chose the winning paths
Which is not true. It calculated possible moves to a certain number of moves out and assigned a point score to each path. Today's chess computers go to 22-25 moves out. No idea how far out deep blue went, but it was never "all possible". If it had done all possible, it would win every time, because it would exploit the opponents failure to make the best move in every game.
And, two computers going 30 moves out, or even more, still does not lead necessarily to a draw.
(post is archived)