The epic battle of man against machine has been fought on many occasions. One of the most memorable encounters was the chess game between IBM’s Deep Blue and Gary Kasparov. Deep Blue was the first computer to beat a reigning chess champion in 1996 (the machine still lost 2 to 4 after six games). A year later, at their “rematch”, the machine won on the overall score: 3.5 to 2.5.
However, it is surprising that, 18 years later, we still have not figured out the ultimate winning strategy in chess. Any game with limited combinations and full disclosure of information must have ‘safe strategies’ and can be ‘solved’ (as has happened with the game checkers in 2007). The solution, in chess, would from what we know today involve strategies whereby the white player would win or the black player would force a draw. Yet no human or super computer to date has managed to solve chess’ mathematical puzzle. How much more computing power do we need to succeed?