Chess Championship: Humans vs. Computer
An anonymous reader writes "X-bit labs has posted very interesting editorial called "Chess Championship: Humans vs. Computer".
During the last 10 years computers penetrated into various spheres of human life. In this article guys try to find out how well computers can
play chess and if it would be correct to say that artificial intelligence is superior to human mind. Interesting read."
The First "Cyborg Championship"?
Meanwhile, Garry Kasparov has arranged for an exhibition match with 23 year old GM Veselin Topalov of Bulgaria for June in which both players will have an (identical) laptop computer that they may consult during the games. The laptops will have databases preloaded by each player (therefore containing their own analysis and selections), as well as a tactical engine. Each game of the 6 game match will last only one hour, meaning that a large part of the strategy will be how much time spend on the computer! A number of analysts are calling this the "First 21st Century World championship" although of course it's only an exhibition. (http://www.uschess.org/clife/issue47/buzz.html)
It's from 1997, but I think they're right. The future does seem to be moving in that direction.
I recall reading an interview with former world chapion karpov who said that when he was learning chess, his teacher said that one day it would all be computers. One of the other students said, "So why are we bothering to do this then?" and the coach replied, "My computer will beat your computer." or something like that. Pretty soon it'll all be down to which computer is better and which person can better control it. I'm sorry I can't better quote the interview. It was in the ChessLife about the Karpov v. Kasparov x3d match in Times Square in case anyone has it.
Learning to understand English is altogether different -- Language has a very complex set of very loosely defined rules which change over time, sometimes quickly, sometimes slowly. Understanding English is very much an AI task.
The problem is knowedge, and how it should be represented -- with Chess you just need a big calculator and present as much of the game (projected) as possible. There is no such way to do this with language... a much more complex representation with much more hueristic knowledge is required, and this is where AI starts coming in. Natural language processing is a very tricky field, one which I won't even pretend I understand, and in my opinion nobody quite does... Chomsky probably coming closest, but then again I'd disagree with him on many points!!
D.
It's been said before, but before we talk about computers becoming superior to the human mind, how about creating an AI that's *equal* to the human mind?
In other words, there's no point in talking about the future where computers rule supreme etc. if we still have no way for a computer to recognize, say, a table from a picture of a table if it does not comply with a series of previously-specified standards. I know it's a horrible analogy but jeez, it's 3:18 AM.
...Which reminds me. Why am I still up? *sighs* Damn you, caffeine.
"The power of accurate observation is frequently called cynicism by those who don't have it." - G.B. Shaw
We judge what the situation most resembles from our experience, and we react accordingly. We act like a case-based learning AI program. We use heuristics to weight our decisions...we just call our heuristics "common sense."
Computers act more like humans, and humans act more like computers, than many people are comfortable to admit. Computers just don't have the mechanisms to experience as wide a variety of stimuli as us.
Take a look at the work of Douglas Hofsteader (sp?). His book, "Fluid Concepts and Creative Analogies," shows relatively simple programs demonstrating surprisingly human-like behaviors.
So, knowledge is hierarchial only insofar that simple addition and subtraction pave the way for more complex algebra... knowing algebra without knowing addition and subtraction would give algebra no meaning.
However, this doesn't account for leaps of thought where entire planes of thinking are bypassed... and nor does it account for mad people (always a tricky one in AI) , especially mad geniuses!
This article gives an introduction to the problems involved in getting computers to play Go:
http://www.ishipress.com/times-go.htm
The interactive way to Go -- http://www.playgo.to/iwtg/en/
Nobody got outraged when that new-fangled mechanical auto-mobile contraption started to outpace the world's fastest human runners.
Allow me to recommend to you the legend of John Henry. About the time period you mention, too. I always mention this story in the Intro AI class I teach.
Baloney. A man is allowed to memorize as many openings as he wants, just as the computer has "memorized" them.
Again, so? Humans are allowed to memorize as much endgame stuff as they want. Why should computers be disallowed this?
Awwww... Why the hell not? Human brains aren't single processor; why should computer opponents have to be?
The same fallacy, repeated over and over again. The human doesn't have none, he has as many as he cares to remember.
And if I were on the computer team, I'd let you. Knock yourself out! Go ahead and fiddle with your chessboard when you could be considering countless more positions in your head.
So, the humans are cheaters then, because they capitalized on computer blunders?
I object to that article, and to the next reply.
Kasparov takes the NYT log postings into account in his recent post. He cites Elo (chess rating) numbers by Ken Thompson (an old school computer chess guy) derived by extrapolating numbers generated by setting a computer program against itself with differing search depths, "world championship"[1] level performance would require 1 billion nodes (moves) per second. Interestingly, "one billion nodes/sec on a single chip" is possible with todays 0.13 micron process, while "a trillion nodes/sec machine is actually possible today" according to one of Feng-Hsiung Hsu (Deep Blue hardware designer).[2]
0 .html?804278037510812]
_____________
[1]Kasparov notes also that the chess performance ranking numbers that Ken Thompson derived were asymptotic(?); "which flattens at the top end" . From Garry Kasparov on Chess Computers (22.01.2003) [ONLINE][http://www.worldchessrating.com/52162987
[2](Note: The "one of Deep Blue's two programmers." citation is incorrect... the followup post clarifies the error.)