Related Research Articles
Chess is a board game for two players, called White and Black, each controlling an army of chess pieces, with the objective to checkmate the opponent's king. It is sometimes called international chess or Western chess to distinguish it from related games such as xiangqi and shogi. The recorded history of chess goes back at least to the emergence of a similar game, chaturanga, in seventh century India. The rules of chess as they are known today emerged in Europe at the end of the 15th century, with standardization and universal acceptance by the end of the 19th century. Today, chess is one of the world's most popular games, and is played by millions of people worldwide.
Deep Blue was a chess-playing expert system run on a unique purpose-built IBM supercomputer. It was the first computer to win a game, and the first to win a match, against a reigning world champion under regular time controls. Development began in 1985 at Carnegie Mellon University under the name ChipTest. It then moved to IBM, where it was first renamed Deep Thought, then again in 1989 to Deep Blue. It first played world champion Garry Kasparov in a six-game match in 1996, where it lost four games to two. It was upgraded in 1997 and in a six-game re-match, it defeated Kasparov by winning two games and drawing three. Deep Blue's victory is considered a milestone in the history of artificial intelligence and has been the subject of several books and films.
Computer chess includes both hardware and software capable of playing chess. Computer chess provides opportunities for players to practice even in the absence of human opponents, and also provides opportunities for analysis, entertainment and training. Computer chess applications that play at the level of a chess grandmaster or higher are available on hardware from supercomputers to smart phones. Standalone chess-playing machines are also available. Stockfish, Leela Chess Zero, GNU Chess, Fruit, and other free open source applications are available for various platforms.
ChipTest was a 1985 chess playing computer built by Feng-hsiung Hsu, Thomas Anantharaman and Murray Campbell at Carnegie Mellon University. It is the predecessor of Deep Thought which in turn evolved into Deep Blue.
David Neil Laurence Levy is an International Master of chess who plays for Scotland, and a businessman. He is noted for his involvement with computer chess and artificial intelligence, and as the founder of the Computer Olympiads and the Mind Sports Olympiads. He has written more than 40 books on chess and computers.
Deep Thought was a computer designed to play chess. Deep Thought was initially developed at Carnegie Mellon University and later at IBM. It was second in the line of chess computers developed by Feng-hsiung Hsu, starting with ChipTest and culminating in Deep Blue. In addition to Hsu, the Deep Thought team included Thomas Anantharaman, Mike Browne, Murray Campbell and Andreas Nowatzyk. Deep Thought became the first computer to beat a grandmaster in a regular tournament game when it beat Bent Larsen in 1988, but was easily defeated in both games of a two-game match with Garry Kasparov in 1989 as well as in a correspondence match with Michael Valvo.
Robert Morgan Hyatt is an American computer scientist and programmer. He co-authored the computer chess programs Crafty and Cray Blitz which won two World Computer Chess Championships in the 1980s. Hyatt was a computer science professor at the University of Southern Mississippi (1970–1985) and University of Alabama at Birmingham (1988–2016).
Zappa, Zap!Chess or Zappa Mexico, is a UCI chess engine written by Anthony Cozzie, a graduate student at the University of Illinois at Urbana-Champaign. The program emphasizes sound search and a good use of multiple processors. Earlier versions of Zappa are free and the current version is available at Shredder Computer Chess.
Belle was a chess computer developed by Joe Condon (hardware) and Ken Thompson (software) at Bell Labs. In 1983, it was the first machine to achieve master-level play, with a USCF rating of 2250. It won the ACM North American Computer Chess Championship five times and the 1980 World Computer Chess Championship. It was the first system to win using specialized chess hardware.
Carol H. Jarecki was an American chess organizer, an International Arbiter, and a chess writer. She served as director or deputy director of many national and international tournaments, including the women’s division of the 40th Chess Olympiad in 2012; the Women’s World Chess Championship 2013; and the U.S. Chess Championship in 2009, 2010, 2011, 2013, 2016 and 2017. She was the arbiter and referee for the 1997 match between Garry Kasparov and the IBM supercomputer program Deep Blue.
Aleksandr Semyonovich Kronrod was a Soviet mathematician and computer scientist, best known for the Gauss–Kronrod quadrature formula which he published in 1964. Earlier, he worked on computational solutions of problems emerging in theoretical physics. He is also known for his contributions to economics, specifically for proposing corrections and calculating price formation for the USSR. Later, Kronrod gave his fortune and life to medicine to care for terminal cancer patients. Kronrod is remembered for his captivating personality and was admired as a student, teacher and leader.
Chess was a pioneering chess program from the 1970s, written by Larry Atkin, David Slate and Keith Gorlen at Northwestern University. Chess ran on Control Data Corporation's line of supercomputers. Work on the program began in 1968 while the authors were graduate students at the university. The first competitive version was Chess 2.0 which gradually evolved to Chess 3.6 and was rewritten as the 4.x series. It dominated the first computer chess tournaments, such as the World Computer Chess Championship and ACM's North American Computer Chess Championship. NWU Chess adopted several innovative or neglected techniques including bitboard data structures, iterative deepening, transposition tables, and an early form of forward pruning later called futility pruning. The 4.x versions were the first programs to abandon selective search in favor of full-width fixed-depth searching.
The School of Computer Science (SOCS) is an academic department in the Faculty of Science at McGill University in Montreal, Quebec, Canada. The school is the second most funded computer science department in Canada. It currently has 34 faculty members, 60 Ph.D. students and 100 Master's students.
Kotok-McCarthy also known as A Chess Playing Program for the IBM 7090 Computer was the first computer program to play chess convincingly. It is also remembered because it played in and lost the first chess match between two computer programs. A pseudocode of the program is in Figure 11.15 of.
Kaissa was a chess program developed in the Soviet Union in the 1960s. It was named so after Caissa, the goddess of chess. Kaissa became the first world computer chess champion in 1974 in Stockholm.
Murray Campbell is a Canadian computer scientist known for being part of the team that created Deep Blue; the first computer to defeat a world chess champion.
This article documents the progress of significant human–computer chess matches.
In turn-based games, permanent brain is the act of thinking during the opponent's turn. Chess engines that continue calculating even when it is not their turn to play end up choosing moves that are stronger than if they are barred from calculating on their opponent's turn.
Monroe "Monty" Newborn, former chairman of the Computer Chess Committee of the Association for Computing Machinery, is a professor emeritus of computer science at McGill University in Montreal. He briefly served as president of the International Computer Chess Association and co-wrote a computer chess program named Ostrich In the 1970's.
Turochamp is a chess program developed by Alan Turing and David Champernowne in 1948. It was created as part of research by the pair into computer science and machine learning. Turochamp is capable of playing an entire chess game against a human player at a low level of play by calculating all potential moves and all potential player moves in response, as well as some further moves it deems considerable. It then assigns point values to each game state, and selects the move resulting in the highest point value.
References
- ↑ Monty Newborn's homepage at McGill University
- ↑ Stinson, Craig (January 1982). "Chess Championship: Machines Play, People Watch". Softline. p. 6. Retrieved 13 July 2014.
