There is one article I want to highlight for today. It is so interesting that it deserves to stand on its own as the link of the day.
(1) “The Chess Master and the Computer” [New York Review of Books] – an incredibly well-written and thought-provoking piece by Garry Kasparov, perhaps the greatest chess player of all time. In the article, Garry Kasparov discusses his play against computers, from the 1980s to the showdown with Deep Blue in 1997 to playing against modern computer chess programs.
Most intriguing to me are Mr. Kasparov’s thoughts on the possibility of solving chess. Imagine this scenario: you make a move in chess, and the computer would be able to calculate the best move under the circumstances and predict the likelihood of achieving mate (and in how many moves it will occur). The concept of solving chess is something I have been thinking about for over ten years, so it’s refreshing to read a Grandmaster’s opinion:
Another group postulated that the game would be solved, i.e., a mathematically conclusive way for a computer to win from the start would be found. (Or perhaps it would prove that a game of chess played in the best possible way always ends in a draw.) Perhaps a real version of HAL 9000 would simply announce move 1.e4, with checkmate in, say, 38,484 moves. These gloomy predictions have not come true, nor will they ever come to pass. Chess is far too complex to be definitively solved with any technology we can conceive of today.
So Mr. Kasparov is not excluding the possibility of chess being solved one day; he simply argues that it is inconceivable to solve the game of chess with the hardware we have today. Mr. Kasparov goes on to explain:
The number of legal chess positions is 1040, the number of different possible games, 10120. Authors have attempted various ways to convey this immensity, usually based on one of the few fields to regularly employ such exponents, astronomy. In his book Chess Metaphors, Diego Rasskin-Gutman points out that a player looking eight moves ahead is already presented with as many possible games as there are stars in the galaxy. Another staple, a variation of which is also used by Rasskin-Gutman, is to say there are more possible chess games than the number of atoms in the universe. All of these comparisons impress upon the casual observer why brute-force computer calculation can’t solve this ancient board game.
If you are at all interested in chess, computer science, or algorithms, I highly encourage you to read the entire article.
One thought on “Link of the Day (01/25/10)”
This paragraph from the article is crucial to my mind:
Like so much else in our technology-rich and innovation-poor modern world, chess computing has fallen prey to incrementalism and the demands of the market. Brute-force programs play the best chess, so why bother with anything else? Why waste time and money experimenting with new and innovative ideas when we already know what works? Such thinking should horrify anyone worthy of the name of scientist, but it seems, tragically, to be the norm. Our best minds have gone into financial engineering instead of real engineering, with catastrophic results for both sectors.
the article should therefore interest just about everyone I believe
thanks for bringing it to my attention