Computers and Chess - A History. In 1. 94. 5 Alan Turing (1.
AI Chess Algorithms. Advanced chess playing programs have far more clever board. (or 'ply' as it's as its referred to in computer chess terminology). C.E. Shannon Programming a Computer for Playing Chess Philosophical Magazine 41, pp 256-275, 1950 57. G. Schrufer Minimax-Suchen Kosten. Currently known best algorithm(s). That is why computer chess engines only examine. a serious chess-playing program will have a library of openings so that. Computer chess is computer architecture encompassing. can improve chess-playing program. alpha-beta search algorithm. 1962 – The first program to. Turing himself was a weak chess player. In 1. 94. 6 Alan Turing made his first reference to machine intelligence in connection with chess- playing. In 1. 94. 7, Alan Turing specified the first chess program for chess. In 1. 94. 8 the UNIVAC computer was advertised as the strongest computer in the world. So strong, that it could play chess and gin rummy so perfectly that no human opponent could beat it. In 1. 94. 8 Turing challenged Donald Michie to see who could first write a simple chess- playing algorithm. In March, 1. 94. 9 Claude Shannon (1. Ferranti digital machine was programmed to solve mates in two moves. He proposed basic strategies for restricting the number of possibilities to be considered in a game of chess. Shannon was an avid chess player. He first proposed his idea of programming a computer for chess at the National Institute for Radio Engineers (IRE) Convention in New York. In 1. 95. 0, Alan Turing wrote the first computer chess program. The same year he proposed the Turing Test that in time, a computer could be programmed (such as playing chess) to acquire abilities rivalling human intelligence. If a human did not see the other human or computer during an imitation game such as chess, he/she would not know the difference between the human and the computer. In 1. 95. 0 Shannon devised a chess playing program that appeared in the paper "Programming a computer for playing chess" published in Philosophical Magazine, Series 7, Vol. No. 3. 14, March 1. This was the first article on computer chess. In November 1. 95. Dr. Dietrich Prinz wrote the original chess playing program for the Manchester Ferranti computer. The program could solve simple mates in two moves. In 1. 95. 2 Alick Glennie, who wrote the first computer compiler, defeated Alan Turing's chess program, Turbo. Champ. He was the first person to beat a computer program at chess. Turing never finished his chess- playing program. In 1. 95. 3 Turing included an example of his chess program in action in chapter 2. Digital Computers Applied to Games) of the book Faster than Thought by B. Bowden. By 1. 95. Univac MANIAC I computer (1. Los Alamos, using a 6x. This was the first documented account of a running chess program. It used a chess set without bishops. It took 1. 2 minutes to search 4 moves deep. Adding the two bishops would have taken 3 hours to search 4 moves deep. MANIAC I had a memory of 6. K, 1. 1KHz speed, and had 2,4. The team that programmed MANIAC was led by Stan Ulam. In 1. 95. 7 a chess program was written by Alex Bernstein at MIT for an IBM 7. It could do 4. 2,0. K. This was the first full- fledged game of chess by a computer. It did a 4- ply search in 8 minutes. In 1. 95. 7 Herbert Simon said that within 1. In 1. 95. 8 the alpha- beta pruning algorithm for chess was discovered by three scientists at Carnegie- Mellon (Allen Newell, John Shaw, and Herbert Simon). Here is how it works. A computer evaluates a move and starts working on its second move. As soon a a single line shows that it will return a lower value than the first move, it can terminate the search. You could now chop off large parts of the search tree without affecting the final results. In 1. 95. 8, a chess program (NSS) beat a human player for the first time. The human player was a secretary who was taught how to play chess one hour before her game with the computer. The computer program was played on an IBM 7. The computer displayed a level of chess- playing expertise greater than an adult human could gain from one hour of chess instruction. In 1. 95. 9 some of the first chess computer programmers predicted that a chess computer would be world chess champion before 1. In 1. 96. 2 the first MIT chess program was written. It was the first chess program that played regular chess credibly. It was written by Alan Kotok for his B. S. thesis project, assisted by John Mc. Carthy of Stanford. The program ran on an IBM 7. In 1. 96. 3 world chess champion Botvinnik predicted that a Russian chess playing program would eventually defeat the World Champion. In 1. 96. 5 the Soviets designed a chess program developed at the Institute for Theoretical and Experimental Physics (ITEP) in Moscow. ITEP's programming team was led by Georgi Adelson- Velskiy. On November 2. 2, 1. USSR chess program began a correspondence match with the Kotok- Mc. Carthy MIT chess program. The match lasted 9 months and was won by the Soviet computer, with 3 wins and 1 loss. The first chess computer to play in a tournament was MAC HACK VI (DEC PDP- 6) written at MIT in assembly language (MIDAS) by Richard Greenblatt. The computer entered the 1. Massachussets Amateur championship, scoring 1 draw and 4 losses for a USCF rating of 1. In the spring of 1. Mac. HACK VI became the first program to beat a human (1. USCF rating), at the Massachussets State Championship. By the end of the year, it had played in four chess tournaments. It won 3 games, lost 1. In 1. 96. 7 Mac. HACK VI was made an honorary member of the US Chess Federation. The MAC HACK program was the first widely distributed chess program, running on many of the PDP machines. It was also the first to have an opening chess book programmed with it. In 1. 96. 8 International Master David Levy made a $3,0. He won his bet. The original bet was with John Mc. Carthy, a distinguished researcher in Artificial Intelligence at Stanford. The bet was made at the 1. Machine Intelligence Workshop in Edinburgh University. In 1. 97. 0 the first all- computer championship was held in New York and won by CHESS 3. CDC 6. 40. 0), a program written by Slate, Atkin and Gorlen at Northwestern University. Six programs had entered the first Association for Computing Machinery (ACM) North American Computer Championships. The event was organized by Monty Newborn. The other programs were DALY CP, J Brit, COKO III, SCHACH, and the Marsland CP. In 1. 97. 1 the Institute of Control Science, Moscow, created KAISSA using a British computer to play chess. In 1. 97. 1 Ken Thompson wrote his first chess- playing program. In 1. 97. 1 CHESS 3. ACM computer championship, held in Chicago. In 1. 97. 2 CHESS 3. ACM computer championship, held in Boston. In 1. 97. 3 CHESS 4. ACM computer championship, held in Atlanta. In 1. 97. 4 World Correspondence Champion Hans Berliner wrote his Ph. D dissertation on "Chess Computers as Problem Solving." In 1. KAISSA (ICL 4/7. 0) won the first world computer chess championship, held in Stockholm with a perfect 4- 0 score. It was programmed by Donskoy and Arlazarov. CHESS 4. 0 In 1. 97. RIBBIT wins the 5th ACM computer championship, held in San Diego. In 1. 97. 5 Grandmaster David Bronstein used the endgame database in KAISSA to win an adjourned game in a tournament in Vilnius. In 1. 97. 5 CHESS 4. ACM computer championship, held in Minneapolis. In 1. 97. 6 CHESS 4. Class B section of the Paul Masson tournament in Northern California. The performance rating was 1. In 1. 97. 6 a computer program was used to make the chess pairings at the chess olympiad in Haifa. In 1. 97. 6 CHESS 4. ACM computer championship, held in Houston. By 1. 97. 6 all legal moves of castling were established by a chess computer. In 1. 97. 7 the first microcomputer chess playing machine, CHESS CHALLENGER, was created. The International Computer Chess Association (ICCA) was founded by computer chess programmers. It has about 4. 00 members. In 1. 97. 7 CHESS 4. Minnesota Open winning 5 games and losing one. It had a performance rating of 2. Stenberg (1. 96. 9) became the first Class A player to lose to a computer. In 1. 97. 7 SNEAKY PETE was the first chess computer to play in a U. S. Open, held in Columbus, Ohio. In 1. 97. 7 Michael Stean became the first grandmaster to lose to a computer; it was a blitz game. In 1. 97. 7, BELLE was the first computer system to use custom design chips to increase its playing strength. It increased its search speed from 2. Over 1,7. 00 integrated ciruits were used to construct BELLE. The chess computer was built by Ken Thompson. The program was later used to solve endgame problems. The cost of BELLE was $2. In 1. 97. 7 CHESS 4. ACM computer championship, held in Seattle. In 1. 97. 7 CHESS 4. Toronto. In 1. 97. International Computer Chess Association was founded. In 1. 97. 7 David Levy played his first computer, KAISSA, as part of his bet. He won. In 1. 97. SARGON won the first tournament for microcomputers, held in San Jose. David Levy collected his 1. CHESS 4. 7 in Toronto with the score of 3 wins and one draw. The drawn game was the first time a computer drew an international master. Computer chess experts predicted that a computer would be world chess champion in 1. In 1. 97. 8 BELLE wins the 9th ACM computer champonship, held in Washington, DC. In 1. 96. 8 David Levy defeated Mac. Hack in 2 games. In 1. CHESS 4. 9 wins the 1. ACM computer championship, held in Detroit. In 1. 98. 0 CHAMPION SENSORY CHALLENGER won the first world microcomputer championship, held in London. In 1. 98. 0, Edward Fredkin created the Fredkin Prize for Computer Chess. The award came with $1. In 1. 98. 0 BELLE wins the 1. ACM computer championship, held in Nashville. In 1. 98. 0 BELLE won the 3rd world computer championship, held in Linz. In 1. 98. 1 CRAY BLITZ won the Mississipi State Championship with a perfect 5- 0 score and a performance rating of 2. In round 4 it defeated Joe Sentef (2. In 1. 98. 1 BELLE wins the 1. ACM computer championship, held in Los Angeles. In 1. 98. 2 BELLE was confiscated by the State Department as it was heading to the Soviet Union to participate in a computer chess tournament. The State Department claimed it was a violation of a technology transfer law to ship a high technology computer to a foreign country. BELLE later played in the U. S. Open speed championship and took 2nd place. By 1. 98. 2 computer chess companies were topping $1. In 1. 98. 2 BELLE wins the 1. ACM computer championship, held in Dallas. In 1. 98. 3, the first chess microcomputer beat a master in tournament play. Last modified: Sat Jul 1. I have copies of some following url contents. You may contact me if the data you want is disappeared. Search Heuristic/Moves Ordering. Pruning. Evaluation function. Endgameself- play, testopeningparallellearning and pattern未分類paperspersonal publicationpaper collection. You may be interested in other collections compiled by me. Contact: kc..@csie.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
September 2016
Categories |