25,161
edits
Changes
Created page with "'''Home * Artificial Intelligence''' FILE:computerzeitalter.jpg|border|right|thumb|link=http://www.schaakkunst.nl/Schaakkunst_besser.htm?id=GK&id2=GA&id3=IN|[..."
'''[[Main Page|Home]] * Artificial Intelligence'''
[[FILE:computerzeitalter.jpg|border|right|thumb|link=http://www.schaakkunst.nl/Schaakkunst_besser.htm?id=GK&id2=GA&id3=IN|[[Arts#Besser|Bernd Besser]], computerzeitalter <ref>[http://www.schaakkunst.nl/Schaakkunst_besser.htm?id=GK&id2=GA&id3=IN Schaakkunst Bernd Besser]</ref> ]]
'''Artificial Intelligence''', (AI)<br/>
the [https://en.wikipedia.org/wiki/Intelligence intelligence] of machines and the branch of computer science that aims to create it. While 'machine intelligence' was already mentioned by [[Alan Turing]] in the 1940s during his research at [https://en.wikipedia.org/wiki/Bletchley_Park Bletchley Park] <ref>[http://www.turing.org.uk/turing/scrapbook/ai.html Alan Turing Scrapbook - the Origins of Artificial Intelligence] by [https://en.wikipedia.org/wiki/Andrew_Hodges Andrew Hodges]</ref> <ref>[https://en.wikipedia.org/wiki/Jack_Copeland B. Jack Copeland], [http://www.canterbury.ac.nz/ucresearchprofile/researcher.aspx?researcherid=84367 Diane Proudfoot] ('''2011-2012'''). ''[http://www.rutherfordjournal.org/article040101.html Turing, Father of the Modern Computer]''. [http://www.rutherfordjournal.org/index.html The Rutherford Journal - The New Zealand Journal for the History and Philosophy of Science and Technology], Vol. 4 » with photos of [[Alan Turing]], [[John von Neumann]], [[Dietrich Prinz]], [[Christopher Strachey]], [[Jack Good]], [[Arthur Samuel]], [[Herbert Simon]], [[Allen Newell]], ...</ref> , the term 'artificial intelligence' was coined by [[John McCarthy]] in the proposal for the 1956 [https://en.wikipedia.org/wiki/Dartmouth_Conferences Dartmouth Conference] <ref>[[John McCarthy]], [[Marvin Minsky]], [[Nathaniel Rochester]], [[Claude Shannon]] ('''1955'''). ''[http://www-formal.stanford.edu/jmc/history/dartmouth/dartmouth.html A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence]''.</ref> . In its beginning, Computer Chess was called the [https://en.wikipedia.org/wiki/Drosophila Drosophila] of [https://en.wikipedia.org/wiki/Artificial_intelligence Artificial Intelligence]. In the 70s, when [[Brute-Force|brute-force]] programs started to dominate, and competitive and commercial aspects have taken precedence over using chess as a scientific domain, the AI community more and more lost interest in chess <ref>[[Hermann Kaindl]] ('''1985'''). ''[http://portal.acm.org/citation.cfm?id=645759.666297 What Happened with AI's Drosophila]''? [http://www.informatik.uni-trier.de/%7Eley/db/conf/ogai/ogai1985.html ÖGAI 1985]: 194-203</ref> . In disagreement with the AI establishment in the 80s, [[Peter W. Frey]] concluded, that the AI community should follow computer chess methods rather than the other way around <ref>[[Peter W. Frey]] ('''1991'''). ''Memory-Based Expertise: Computer Chess vs. AI'', [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]]</ref> .
=Drosophila of AI=
==[[Donald Michie]]==
Quote from ''I remember Donald Michie'' by [[Maarten van Emden]] <ref>[http://vanemden.wordpress.com/2009/06/12/i-remember-donald-michie-1923-2007/ I remember Donald Michie (1923 – 2007) « A Programmers Place] by [[Maarten van Emden]], June 12, 2009</ref> :
In the 1970s DM was fond of proclaiming “Chess, the [https://en.wikipedia.org/wiki/Drosophila_melanogaster Drosophila Melanogaster] of Artificial Intelligence”. A public pronouncement of his point of view can be found in an interview with [[Jaap van den Herik|H.J. van den Herik]] held in 1981 (“Computerschaak, schaakwereld en kunstmatige intelligentie” by H.J. van den Herik, Academic Service, 1983) <ref>[[Jaap van den Herik]] ('''1981'''). ''Computer Chess Today and Tomorrow: An Interview with [[Donald Michie]]''. [[Computer Chess Reports|Computer Chess Digest Annual 1984]]</ref> . It is a long interview, from which I quote DM’s answer to the question: “What do you think about the applicability of the research done in computer chess?”
The applicability is I think enormous and quite critical. Scientific study of computer chess, which includes the technological work, but goes far beyond that, is the most important scientific study that is going in the world at present. In the same sense, if I were asked what was the most important study in process during the first world war, I would say the genetic breeding experiments on the drosophila fruit fly by [https://en.wikipedia.org/wiki/Thomas_Hunt_Morgan Morgan] and his colleagues. The analogy is very good. The final impact of the early work in laying down the basic theoretical framework for the subject was just enormous, unimaginable. We see now the industrial take-off of [https://en.wikipedia.org/wiki/Genetic_engineering genetic engineering] which is the delayed final outcome for human society of the fly-breeding work. The use of chess now as a preliminary to the knowledge engineering and cognitive engineering of the future is exactly similar, in my opinion, to the work on drosophila. It should be encouraged in a very intense way, for these reasons.
<span id="McCarthy"></span>
==John McCarthy==
{{Quote McCarthy on AI}}
==Anthony Cozzie==
[[Anthony Cozzie]] in a forum discussion about McCarthy's statement <ref>[http://www.stmintz.com/ccc/index.php?id=419893 Fruit fly races] by [[Steven Edwards]], [[CCC]], April 06, 2005</ref> <ref>[http://www.stmintz.com/ccc/index.php?id=419900 Re: Fruit fly races] by [[Anthony Cozzie]], [[CCC]], April 06, 2005</ref> :
First, the author of this quote is simple WRONG. The generally accepted theory of how humans play chess is that the brain does fuzzy matching on a database of several hundred thousand positions. The amount of computation needed to do that is FAR greater than the amount expended by a "conventional" AB searcher, and yet the computer plays MUCH better than the average human. The simple fact of the matter, which you refuse to recognize, is that AB-search with reasonable heuristics is the most efficient way to play chess with Von Neuman machines.
Secondly, the existence of current amateur and commercial programs does nothing to prevent you from writing whatever kind of chess playing agent you want. If you want to experiment, no one is stopping you or him from applying to NSF for research money and giving it a shot. The existence of "fruit fly races" - and his fruit fly analogy is totally flawed. A better analogy would be that a geneticist decided to make a fruit fly that could run faster than a human - does nothing to prevent casual study of one's own fruit flies.
=Heuristic Programming=
==Remembering Kronrod==
{{Remembering A.S. Kronrod}}
==Intellectual Foundations==
{{Quote Yershov}}
=The 12th IJCAI=
In a panel discussion at the [[Conferences#IJCAI1991|12th International Joint Conference on Artificial Intelligence]], [[Robert Levinson]], [[Feng-hsiung Hsu]], [[Tony Marsland]], [[Jonathan Schaeffer]], and [[David Wilkins]] commented on the relationship between computer chess and AI research <ref>[[Robert Levinson]], [[Feng-hsiung Hsu]], [[Tony Marsland]], [[Jonathan Schaeffer]], [[David Wilkins]] ('''1991'''). ''The Role of Chess in Artificial Intelligence Research''. [http://dli.iiit.ac.in/ijcai/IJCAI-91-VOL1/CONTENT/content.htm IJCAI 1991], [http://dli.iiit.ac.in/ijcai/IJCAI-91-VOL1/PDF/084.pdf pdf], also in [[ICGA Journal#14_3|ICCA Journal, Vol. 14, No. 3]], [http://www.ai.sri.com/%7Ewilkins/papers/chess-panel.pdf pdf]</ref> . As pointed out by [[Peter W. Frey]], many emphasized the discrepancy between both domains and seemed to lament the inferiour status of the work of computer chess - some excerpts quoted by Frey in his ''Computer Chess vs. AI'' paper <ref>[[Peter W. Frey]] ('''1991'''). ''Memory-Based Expertise: Computer Chess vs. AI''. [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]]</ref> .
==[[Jonathan Schaeffer]]==
Sadly, most of the work currently being done on computer chess programs is engineering, not science. For example, the engineering of special-purpose VLSI chips to increase the speed of a chess program only underlines the importance chess programmers attach to speed. In my opinion, conventional computer-chess methods will yield little of further interest to the AI community.
==[[Tony Marsland]]==
Pruning by analogy is a powerful general-purpose tool and if developed satisfactorily for a perfect information game like chess would almost certainly be applicable to related decision-tree searches...
It is remarkable that no significant improvement has been made to that method, despite the passage of 15 years. Not even attempts to implement simple forms of the idea in serious chess programs.
==[[Robert Levinson]]==
Psychological evidence indicates that human chess players search very few positions, and base their positional assessments on structural/perceptual patterns learned through experience.
The main objectives of the project are to demonstrate capacity of the system to learn, to deepen our understanding of the interaction of knowledge and search, and to build bridges in this area between AI and cognitive science.
==[[David Wilkins]]==
Hardware advances have made chess a less fertile ground for addressing the basic issues of AI. The game is small enough that brute-force search techniques have dominated competitive computer chess, and I see little AI interest in squeezing out the last few hundred points on the chess ratings.
=AI as Sport=
[[John McCarthy]] from ''AI as Sport'', 1997 <ref>[[John McCarthy]] ('''1997'''). ''[http://www-formal.stanford.edu/jmc/newborn/newborn.html AI as Sport].'' Science, Vol. 276</ref> , in a review of [[Monroe Newborn|Monty Newborn's]] ''[[Kasparov versus Deep Blue 1997|Deep Blue vs. Kasparov]]'' <ref>[[Monroe Newborn]] ('''1997'''). ''Kasparov versus DEEP BLUE: Computer Chess Comes of Age.'' Springer</ref> :
Now that computers have reached world-champion level, it is time for chess to become a Drosophila again. Champion-level play is possible with enormously less computation than [[Deep Blue]] and its recent competitors use. Tournaments should admit programs only with severe limits on computation. This would concentrate attention on scientific advances. Perhaps a personal computer manufacturer would sponsor a tournament with one second allowed per move on a machine of a single design. Tournaments in which players use computers to check out lines of play would be man-machine collaboration rather than just competition.
Besides AI work aimed at tournament play, particular aspects of the game have illuminated the intellectual mechanisms involved. [[Barbara Liskov]] demonstrated that what chess books teach about how to win certain endgames is not a program but more like a predicate comparing two positions to see if one is an improvement on the other. Such qualitative comparisons are an important feature of human intelligence and are needed for AI. [[Donald Michie]], [[Ivan Bratko]], [[Alen Shapiro]], [[David Wilkins]], and others have also used chess as a Drosophila to study intelligence. [[Monroe Newborn|Newborn]] ignores this work, because it is not oriented to tournament play.
=Making Computer Chess Scientific=
A further note by [[John McCarthy]] from ''Making Computer Chess Scientific'' <ref>[http://www-formal.stanford.edu/jmc/chess.html Making Computer Chess Scientific] by [[John McCarthy]]</ref> :
AI has two tools for tackling problems. One is to use methods observed in humans, often observed only by introspection, and the other is to invent methods using ideas of computer science without worrying about whether humans do it this way. Chess programming employs both. Introspection is an unreliable way of determining how humans think, but introspectively suggested methods are valid as AI if they work.
Much of the mental computation done by chess players is invisible to the player and to outside observers. Patterns in the position suggest what lines of play to look at, and the pattern recognition processes in the human mind seem to be invisible to that mind. However, the parts of the move tree that are examined are consciously accessible.
It is an important advantage of chess as a Drosophila for AI that so much of the thought that goes into human chess play is visible to the player and even to spectators. When chess players argue about what is the right move in a position, they follow out lines of play, i.e. argue explicitly about parts of the move tree. Moreover, when a player is found to have made a mistake, it is almost always a failure to follow out a certain line of play rather than a misevaluation of a final position.
<span id="GoTheNewDrosophila"></span>
=Go, the new Drosophila of AI=
A quote by [[Gian-Carlo Pascutto]] on AI in [[Go]] and Chess <ref>[http://computer-go.org/pipermail/computer-go/2010-June/000376.html Re: Chess vs Go // AI vs IA] by [[Gian-Carlo Pascutto]], June 02, 2010</ref> :
There is no significant difference between an [[Alpha-Beta|alpha-beta search]] with heavy [[Late Move Reductions|LMR]] and a [[Evaluation|static evaluator]] (current state of the art in chess) and an [[UCT]] searcher with a small exploration constant that does playouts (state of the art in go).
The shape of the [[Search Tree|tree]] they search is very similar. The main breakthrough in Go the last few years was how to backup an uncertain Monte Carlo score. This was solved. For chess this same problem was solved around the time [[Quiescence Search|quiescent search]] was developed.
Both are producing strong programs and we've proven for both the methods that they scale in strength as hardware speed goes up.
So I would say that we've successfully adopted the simple, brute force methods for chess to Go and they already work without increases in computer speed. The increases will make them progressively stronger though, and with further software tweaks they will eventually surpass humans.
=Poker, the next Challenge=
[[Graham Kendall]] and [[Jonathan Schaeffer]] on [http://ilk.uvt.nl/icga/games/Poker/ Poker] <ref>[[Graham Kendall]], [[Jonathan Schaeffer]] ('''2006'''). ''[http://ilk.uvt.nl/icga/games/Poker/ Poker]''. [[ICGA Journal#29_3|ICGA Journal, Vol. 29, No. 3]]</ref> :
For many years Chess (and perhaps more recently Go) has served as the Drosophila of AI research. Decades of research culminated in the defeat of Garry Kasparov by DEEP BLUE in May 1997. There is still an active research community that uses Chess as a test-bed for AI research (as seen in this journal), but the game is limited in the types of challenges that it can offer to the AI researcher. Being a game of perfect information (both players know the full state of the game at any given point) with a relatively small branching factor, researchers have reduced the challenge of building a strong AI for Chess to merely one of deep brute-force search. The research challenges are to create a good evaluation function, and to design an effective search algorithm. This “solution” to Chess is unappealing to many AI purists. Nevertheless, alternative AI approaches have been largely ineffective.
Poker, as an experimental test-bed for exploring AI, is a much richer domain than Chess (and Go).
# Imperfect information. Parts of the game state (opponent hands) are not known.
# Multiple players. Many popular poker variants can be played with up to 10 players.
# Stochastic. The dealing of the cards adds a random element to the game.
# Deception. Predictable play can be exploited by an opponent. Hence, deceptive play is an essential ingredient of strong play (e.g., bluffing).
# Opponent modelling. Observing your opponent(s) and adjusting your play to exploit (perceived) opponent tendencies is necessary to maximize poker winnings.
# Information sparsity. Many poker hands end in the players not revealing their cards. This limits the amount of data available to learn from.
=Subfields=
* [[Genetic Programming]]
* [[Learning]]
: [[Deep Learning]]
* [[Neural Networks]]
* [[Planning]]
* [[Robots]]
=See also=
* [[Cognition]]
* [[Knowledge]]
* [[Psychology]]
* [[Search]]
* [[Alan Turing#TuringTest|Turing Test]]
=References=
<references />
'''[[Main Page|Up one Level]]'''
[[FILE:computerzeitalter.jpg|border|right|thumb|link=http://www.schaakkunst.nl/Schaakkunst_besser.htm?id=GK&id2=GA&id3=IN|[[Arts#Besser|Bernd Besser]], computerzeitalter <ref>[http://www.schaakkunst.nl/Schaakkunst_besser.htm?id=GK&id2=GA&id3=IN Schaakkunst Bernd Besser]</ref> ]]
'''Artificial Intelligence''', (AI)<br/>
the [https://en.wikipedia.org/wiki/Intelligence intelligence] of machines and the branch of computer science that aims to create it. While 'machine intelligence' was already mentioned by [[Alan Turing]] in the 1940s during his research at [https://en.wikipedia.org/wiki/Bletchley_Park Bletchley Park] <ref>[http://www.turing.org.uk/turing/scrapbook/ai.html Alan Turing Scrapbook - the Origins of Artificial Intelligence] by [https://en.wikipedia.org/wiki/Andrew_Hodges Andrew Hodges]</ref> <ref>[https://en.wikipedia.org/wiki/Jack_Copeland B. Jack Copeland], [http://www.canterbury.ac.nz/ucresearchprofile/researcher.aspx?researcherid=84367 Diane Proudfoot] ('''2011-2012'''). ''[http://www.rutherfordjournal.org/article040101.html Turing, Father of the Modern Computer]''. [http://www.rutherfordjournal.org/index.html The Rutherford Journal - The New Zealand Journal for the History and Philosophy of Science and Technology], Vol. 4 » with photos of [[Alan Turing]], [[John von Neumann]], [[Dietrich Prinz]], [[Christopher Strachey]], [[Jack Good]], [[Arthur Samuel]], [[Herbert Simon]], [[Allen Newell]], ...</ref> , the term 'artificial intelligence' was coined by [[John McCarthy]] in the proposal for the 1956 [https://en.wikipedia.org/wiki/Dartmouth_Conferences Dartmouth Conference] <ref>[[John McCarthy]], [[Marvin Minsky]], [[Nathaniel Rochester]], [[Claude Shannon]] ('''1955'''). ''[http://www-formal.stanford.edu/jmc/history/dartmouth/dartmouth.html A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence]''.</ref> . In its beginning, Computer Chess was called the [https://en.wikipedia.org/wiki/Drosophila Drosophila] of [https://en.wikipedia.org/wiki/Artificial_intelligence Artificial Intelligence]. In the 70s, when [[Brute-Force|brute-force]] programs started to dominate, and competitive and commercial aspects have taken precedence over using chess as a scientific domain, the AI community more and more lost interest in chess <ref>[[Hermann Kaindl]] ('''1985'''). ''[http://portal.acm.org/citation.cfm?id=645759.666297 What Happened with AI's Drosophila]''? [http://www.informatik.uni-trier.de/%7Eley/db/conf/ogai/ogai1985.html ÖGAI 1985]: 194-203</ref> . In disagreement with the AI establishment in the 80s, [[Peter W. Frey]] concluded, that the AI community should follow computer chess methods rather than the other way around <ref>[[Peter W. Frey]] ('''1991'''). ''Memory-Based Expertise: Computer Chess vs. AI'', [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]]</ref> .
=Drosophila of AI=
==[[Donald Michie]]==
Quote from ''I remember Donald Michie'' by [[Maarten van Emden]] <ref>[http://vanemden.wordpress.com/2009/06/12/i-remember-donald-michie-1923-2007/ I remember Donald Michie (1923 – 2007) « A Programmers Place] by [[Maarten van Emden]], June 12, 2009</ref> :
In the 1970s DM was fond of proclaiming “Chess, the [https://en.wikipedia.org/wiki/Drosophila_melanogaster Drosophila Melanogaster] of Artificial Intelligence”. A public pronouncement of his point of view can be found in an interview with [[Jaap van den Herik|H.J. van den Herik]] held in 1981 (“Computerschaak, schaakwereld en kunstmatige intelligentie” by H.J. van den Herik, Academic Service, 1983) <ref>[[Jaap van den Herik]] ('''1981'''). ''Computer Chess Today and Tomorrow: An Interview with [[Donald Michie]]''. [[Computer Chess Reports|Computer Chess Digest Annual 1984]]</ref> . It is a long interview, from which I quote DM’s answer to the question: “What do you think about the applicability of the research done in computer chess?”
The applicability is I think enormous and quite critical. Scientific study of computer chess, which includes the technological work, but goes far beyond that, is the most important scientific study that is going in the world at present. In the same sense, if I were asked what was the most important study in process during the first world war, I would say the genetic breeding experiments on the drosophila fruit fly by [https://en.wikipedia.org/wiki/Thomas_Hunt_Morgan Morgan] and his colleagues. The analogy is very good. The final impact of the early work in laying down the basic theoretical framework for the subject was just enormous, unimaginable. We see now the industrial take-off of [https://en.wikipedia.org/wiki/Genetic_engineering genetic engineering] which is the delayed final outcome for human society of the fly-breeding work. The use of chess now as a preliminary to the knowledge engineering and cognitive engineering of the future is exactly similar, in my opinion, to the work on drosophila. It should be encouraged in a very intense way, for these reasons.
<span id="McCarthy"></span>
==John McCarthy==
{{Quote McCarthy on AI}}
==Anthony Cozzie==
[[Anthony Cozzie]] in a forum discussion about McCarthy's statement <ref>[http://www.stmintz.com/ccc/index.php?id=419893 Fruit fly races] by [[Steven Edwards]], [[CCC]], April 06, 2005</ref> <ref>[http://www.stmintz.com/ccc/index.php?id=419900 Re: Fruit fly races] by [[Anthony Cozzie]], [[CCC]], April 06, 2005</ref> :
First, the author of this quote is simple WRONG. The generally accepted theory of how humans play chess is that the brain does fuzzy matching on a database of several hundred thousand positions. The amount of computation needed to do that is FAR greater than the amount expended by a "conventional" AB searcher, and yet the computer plays MUCH better than the average human. The simple fact of the matter, which you refuse to recognize, is that AB-search with reasonable heuristics is the most efficient way to play chess with Von Neuman machines.
Secondly, the existence of current amateur and commercial programs does nothing to prevent you from writing whatever kind of chess playing agent you want. If you want to experiment, no one is stopping you or him from applying to NSF for research money and giving it a shot. The existence of "fruit fly races" - and his fruit fly analogy is totally flawed. A better analogy would be that a geneticist decided to make a fruit fly that could run faster than a human - does nothing to prevent casual study of one's own fruit flies.
=Heuristic Programming=
==Remembering Kronrod==
{{Remembering A.S. Kronrod}}
==Intellectual Foundations==
{{Quote Yershov}}
=The 12th IJCAI=
In a panel discussion at the [[Conferences#IJCAI1991|12th International Joint Conference on Artificial Intelligence]], [[Robert Levinson]], [[Feng-hsiung Hsu]], [[Tony Marsland]], [[Jonathan Schaeffer]], and [[David Wilkins]] commented on the relationship between computer chess and AI research <ref>[[Robert Levinson]], [[Feng-hsiung Hsu]], [[Tony Marsland]], [[Jonathan Schaeffer]], [[David Wilkins]] ('''1991'''). ''The Role of Chess in Artificial Intelligence Research''. [http://dli.iiit.ac.in/ijcai/IJCAI-91-VOL1/CONTENT/content.htm IJCAI 1991], [http://dli.iiit.ac.in/ijcai/IJCAI-91-VOL1/PDF/084.pdf pdf], also in [[ICGA Journal#14_3|ICCA Journal, Vol. 14, No. 3]], [http://www.ai.sri.com/%7Ewilkins/papers/chess-panel.pdf pdf]</ref> . As pointed out by [[Peter W. Frey]], many emphasized the discrepancy between both domains and seemed to lament the inferiour status of the work of computer chess - some excerpts quoted by Frey in his ''Computer Chess vs. AI'' paper <ref>[[Peter W. Frey]] ('''1991'''). ''Memory-Based Expertise: Computer Chess vs. AI''. [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]]</ref> .
==[[Jonathan Schaeffer]]==
Sadly, most of the work currently being done on computer chess programs is engineering, not science. For example, the engineering of special-purpose VLSI chips to increase the speed of a chess program only underlines the importance chess programmers attach to speed. In my opinion, conventional computer-chess methods will yield little of further interest to the AI community.
==[[Tony Marsland]]==
Pruning by analogy is a powerful general-purpose tool and if developed satisfactorily for a perfect information game like chess would almost certainly be applicable to related decision-tree searches...
It is remarkable that no significant improvement has been made to that method, despite the passage of 15 years. Not even attempts to implement simple forms of the idea in serious chess programs.
==[[Robert Levinson]]==
Psychological evidence indicates that human chess players search very few positions, and base their positional assessments on structural/perceptual patterns learned through experience.
The main objectives of the project are to demonstrate capacity of the system to learn, to deepen our understanding of the interaction of knowledge and search, and to build bridges in this area between AI and cognitive science.
==[[David Wilkins]]==
Hardware advances have made chess a less fertile ground for addressing the basic issues of AI. The game is small enough that brute-force search techniques have dominated competitive computer chess, and I see little AI interest in squeezing out the last few hundred points on the chess ratings.
=AI as Sport=
[[John McCarthy]] from ''AI as Sport'', 1997 <ref>[[John McCarthy]] ('''1997'''). ''[http://www-formal.stanford.edu/jmc/newborn/newborn.html AI as Sport].'' Science, Vol. 276</ref> , in a review of [[Monroe Newborn|Monty Newborn's]] ''[[Kasparov versus Deep Blue 1997|Deep Blue vs. Kasparov]]'' <ref>[[Monroe Newborn]] ('''1997'''). ''Kasparov versus DEEP BLUE: Computer Chess Comes of Age.'' Springer</ref> :
Now that computers have reached world-champion level, it is time for chess to become a Drosophila again. Champion-level play is possible with enormously less computation than [[Deep Blue]] and its recent competitors use. Tournaments should admit programs only with severe limits on computation. This would concentrate attention on scientific advances. Perhaps a personal computer manufacturer would sponsor a tournament with one second allowed per move on a machine of a single design. Tournaments in which players use computers to check out lines of play would be man-machine collaboration rather than just competition.
Besides AI work aimed at tournament play, particular aspects of the game have illuminated the intellectual mechanisms involved. [[Barbara Liskov]] demonstrated that what chess books teach about how to win certain endgames is not a program but more like a predicate comparing two positions to see if one is an improvement on the other. Such qualitative comparisons are an important feature of human intelligence and are needed for AI. [[Donald Michie]], [[Ivan Bratko]], [[Alen Shapiro]], [[David Wilkins]], and others have also used chess as a Drosophila to study intelligence. [[Monroe Newborn|Newborn]] ignores this work, because it is not oriented to tournament play.
=Making Computer Chess Scientific=
A further note by [[John McCarthy]] from ''Making Computer Chess Scientific'' <ref>[http://www-formal.stanford.edu/jmc/chess.html Making Computer Chess Scientific] by [[John McCarthy]]</ref> :
AI has two tools for tackling problems. One is to use methods observed in humans, often observed only by introspection, and the other is to invent methods using ideas of computer science without worrying about whether humans do it this way. Chess programming employs both. Introspection is an unreliable way of determining how humans think, but introspectively suggested methods are valid as AI if they work.
Much of the mental computation done by chess players is invisible to the player and to outside observers. Patterns in the position suggest what lines of play to look at, and the pattern recognition processes in the human mind seem to be invisible to that mind. However, the parts of the move tree that are examined are consciously accessible.
It is an important advantage of chess as a Drosophila for AI that so much of the thought that goes into human chess play is visible to the player and even to spectators. When chess players argue about what is the right move in a position, they follow out lines of play, i.e. argue explicitly about parts of the move tree. Moreover, when a player is found to have made a mistake, it is almost always a failure to follow out a certain line of play rather than a misevaluation of a final position.
<span id="GoTheNewDrosophila"></span>
=Go, the new Drosophila of AI=
A quote by [[Gian-Carlo Pascutto]] on AI in [[Go]] and Chess <ref>[http://computer-go.org/pipermail/computer-go/2010-June/000376.html Re: Chess vs Go // AI vs IA] by [[Gian-Carlo Pascutto]], June 02, 2010</ref> :
There is no significant difference between an [[Alpha-Beta|alpha-beta search]] with heavy [[Late Move Reductions|LMR]] and a [[Evaluation|static evaluator]] (current state of the art in chess) and an [[UCT]] searcher with a small exploration constant that does playouts (state of the art in go).
The shape of the [[Search Tree|tree]] they search is very similar. The main breakthrough in Go the last few years was how to backup an uncertain Monte Carlo score. This was solved. For chess this same problem was solved around the time [[Quiescence Search|quiescent search]] was developed.
Both are producing strong programs and we've proven for both the methods that they scale in strength as hardware speed goes up.
So I would say that we've successfully adopted the simple, brute force methods for chess to Go and they already work without increases in computer speed. The increases will make them progressively stronger though, and with further software tweaks they will eventually surpass humans.
=Poker, the next Challenge=
[[Graham Kendall]] and [[Jonathan Schaeffer]] on [http://ilk.uvt.nl/icga/games/Poker/ Poker] <ref>[[Graham Kendall]], [[Jonathan Schaeffer]] ('''2006'''). ''[http://ilk.uvt.nl/icga/games/Poker/ Poker]''. [[ICGA Journal#29_3|ICGA Journal, Vol. 29, No. 3]]</ref> :
For many years Chess (and perhaps more recently Go) has served as the Drosophila of AI research. Decades of research culminated in the defeat of Garry Kasparov by DEEP BLUE in May 1997. There is still an active research community that uses Chess as a test-bed for AI research (as seen in this journal), but the game is limited in the types of challenges that it can offer to the AI researcher. Being a game of perfect information (both players know the full state of the game at any given point) with a relatively small branching factor, researchers have reduced the challenge of building a strong AI for Chess to merely one of deep brute-force search. The research challenges are to create a good evaluation function, and to design an effective search algorithm. This “solution” to Chess is unappealing to many AI purists. Nevertheless, alternative AI approaches have been largely ineffective.
Poker, as an experimental test-bed for exploring AI, is a much richer domain than Chess (and Go).
# Imperfect information. Parts of the game state (opponent hands) are not known.
# Multiple players. Many popular poker variants can be played with up to 10 players.
# Stochastic. The dealing of the cards adds a random element to the game.
# Deception. Predictable play can be exploited by an opponent. Hence, deceptive play is an essential ingredient of strong play (e.g., bluffing).
# Opponent modelling. Observing your opponent(s) and adjusting your play to exploit (perceived) opponent tendencies is necessary to maximize poker winnings.
# Information sparsity. Many poker hands end in the players not revealing their cards. This limits the amount of data available to learn from.
=Subfields=
* [[Genetic Programming]]
* [[Learning]]
: [[Deep Learning]]
* [[Neural Networks]]
* [[Planning]]
* [[Robots]]
=See also=
* [[Cognition]]
* [[Knowledge]]
* [[Psychology]]
* [[Search]]
* [[Alan Turing#TuringTest|Turing Test]]
=References=
<references />
'''[[Main Page|Up one Level]]'''
