SettingsComputer chess
Advanced Chess
Advanced Chess is a relatively new form of chess, wherein each human player uses a computer chess program to help him explore the possible results of candidate moves.
Advanced Chess is a relatively new form of chess, wherein each human player uses a computer chess program to help him explore the possible results of candidate moves.
Alan Kotok
Alan Kotok was an American computer scientist known for his work at Digital Equipment Corporation and at the World Wide Web Consortium.
Alan Kotok was an American computer scientist known for his work at Digital Equipment Corporation and at the World Wide Web Consortium.
Alexander Brudno
Alexander L'vovich Brudno was a Russian Jewish computer scientist, best known for fully describing the alpha-beta pruning algorithm.
Alexander L'vovich Brudno was a Russian Jewish computer scientist, best known for fully describing the alpha-beta pruning algorithm.
Anti-computer tactics (gaming)
Anti-computer tactics are a style of play used by humans to beat strong computer opponents at various games, especially in board games such as chess and Arimaa.
Anti-computer tactics are a style of play used by humans to beat strong computer opponents at various games, especially in board games such as chess and Arimaa.
Board representation (chess)
Several data structures exist, collectively known as board representations.
Several data structures exist, collectively known as board representations.
Brains in Bahrain
Brains in Bahrain was an eight-game chess match between World Chess Champion Vladimir Kramnik and the computer program Deep Fritz 7, held in October 2002.
Brains in Bahrain was an eight-game chess match between World Chess Champion Vladimir Kramnik and the computer program Deep Fritz 7, held in October 2002.
Branching factor
In computing, tree data structures, and game theory, the branching factor is the number of children at each node.
In computing, tree data structures, and game theory, the branching factor is the number of children at each node.
Candidate move
In abstract strategy board games, candidate moves are moves which, upon initial observation of the position, seem to warrant further analysis.
In abstract strategy board games, candidate moves are moves which, upon initial observation of the position, seem to warrant further analysis.
Chess engine
A chess engine is one component of a computer program that plays chess.
A chess engine is one component of a computer program that plays chess.
Chess Engine Communication Protocol
The Chess Engine Communication Protocol is an open communication protocol that enables a chess engine to communicate with its user interface.
The Chess Engine Communication Protocol is an open communication protocol that enables a chess engine to communicate with its user interface.
Chess Engines Grand Tournament
Chess Engines Grand Tournament, also known as CEGT, is one of the best-known organizations that tests computer chess software by playing chess programs against one another and producing a ...
Chess Engines Grand Tournament, also known as CEGT, is one of the best-known organizations that tests computer chess software by playing chess programs against one another and producing a ...
Chess Query Language
Chess Query Language (CQL) is a structured query language which is designed to allow chess players and researchers to search for games, positions, problems, and studies in a quick and relatively...
Chess Query Language (CQL) is a structured query language which is designed to allow chess players and researchers to search for games, positions, problems, and studies in a quick and relatively...
Chess960@home
Chess960@home is a distributed computing project that runs on the BOINC software platform.
Chess960@home is a distributed computing project that runs on the BOINC software platform.
Christian Donninger
Christian Donninger, also known as "Chrilly", is the main programmer of the chess computer Hydra, which is one of the strongest chess computer in the world.
Christian Donninger, also known as "Chrilly", is the main programmer of the chess computer Hydra, which is one of the strongest chess computer in the world.
Computer chess
Computer chess is computer architecture encompassing hardware and software capable of playing chess autonomously without human guidance.
Computer chess is computer architecture encompassing hardware and software capable of playing chess autonomously without human guidance.
Computer Olympiad
The Computer Olympiads are a multi-games event taking place every year in which computer programs compete against each other.
The Computer Olympiads are a multi-games event taking place every year in which computer programs compete against each other.
Deep Blue (chess computer)
Deep Blue was a chess-playing computer developed by IBM. On May 11, 1997, the machine won the second six-game match against world champion Garry Kasparov by two wins to one with three draws.
Deep Blue was a chess-playing computer developed by IBM. On May 11, 1997, the machine won the second six-game match against world champion Garry Kasparov by two wins to one with three draws.
Deep Blue - Kasparov, 1996, Game 1
Deep Blue – Kasparov, 1996, Game 1 is a famous chess game in which a computer played against a human being.
Deep Blue – Kasparov, 1996, Game 1 is a famous chess game in which a computer played against a human being.
Deep Blue versus Garry Kasparov
Deep Blue versus Garry Kasparov was a pair of famous six-game human–computer chess matches played between the IBM supercomputer Deep Blue and the World Chess Champion Garry Kasparov.
Deep Blue versus Garry Kasparov was a pair of famous six-game human–computer chess matches played between the IBM supercomputer Deep Blue and the World Chess Champion Garry Kasparov.
Deep Blue versus Kasparov, 1996, Game 1
Deep Blue–Kasparov, 1996, Game 1 is a famous chess game in which a computer played against a human being.
Deep Blue–Kasparov, 1996, Game 1 is a famous chess game in which a computer played against a human being.
Deep Blue versus Kasparov, 1997, Game 6
Game 6 of the Deep Blue–Kasparov rematch, played in New York City on May 11, 1997 and starting at 3:00 p.m.
Game 6 of the Deep Blue–Kasparov rematch, played in New York City on May 11, 1997 and starting at 3:00 p.m.
Deep Blue – Kasparov, 1996, Game 1
Deep Blue – Kasparov, 1996, Game 1 is a famous chess game in which a computer played against a human being.
Deep Blue – Kasparov, 1996, Game 1 is a famous chess game in which a computer played against a human being.
Deep Blue – Kasparov, 1997, Game 6
The Sixth game of the Deep Blue - Kasparov rematch, played in New York City on May 11, 1997 and starting at 3:00 p.m.
The Sixth game of the Deep Blue - Kasparov rematch, played in New York City on May 11, 1997 and starting at 3:00 p.m.
Endgame tablebase
An endgame tablebase is a computerized database that contains precalculated exhaustive analysis of a chess endgame position.
An endgame tablebase is a computerized database that contains precalculated exhaustive analysis of a chess endgame position.
Eugene Nalimov
Eugene Nalimov (born 1965 in Novosibirsk, U.S.S.R.) is a chess programmer and former Microsoft employee.
Eugene Nalimov (born 1965 in Novosibirsk, U.S.S.R.) is a chess programmer and former Microsoft employee.
Evaluation function
An evaluation function, also known as a heuristic evaluation function or static evaluation function, is a function used by game-playing programs to estimate the value or goodness of ...
An evaluation function, also known as a heuristic evaluation function or static evaluation function, is a function used by game-playing programs to estimate the value or goodness of ...
Feng-hsiung Hsu
Feng-hsiung Hsu is a computer scientist and the author of the book Behind Deep Blue: Building the Computer that Defeated the World Chess Champion.
Feng-hsiung Hsu is a computer scientist and the author of the book Behind Deep Blue: Building the Computer that Defeated the World Chess Champion.
Forsyth-Edwards Notation
Forsyth–Edwards Notation (FEN) is a standard notation for describing a particular board position of a chess game.
Forsyth–Edwards Notation (FEN) is a standard notation for describing a particular board position of a chess game.
Forsyth–Edwards Notation
Forsyth–Edwards Notation (FEN) is a standard notation for describing a particular board position of a chess game.
Forsyth–Edwards Notation (FEN) is a standard notation for describing a particular board position of a chess game.
Game Over: Kasparov and the Machine
Game Over: Kasparov and the Machine is a 2003 documentary film by Vikram Jayanti about the match between Garry Kasparov, the highest rated chess player in history and the World Champion for ...
Game Over: Kasparov and the Machine is a 2003 documentary film by Vikram Jayanti about the match between Garry Kasparov, the highest rated chess player in history and the World Champion for ...
Georgy Adelson-Velsky
Georgy Maximovich Adelson-Velsky (Гео́ргий Макси́мович Адельсо́н-Ве́льский; name is sometimes transliterated as Georgii Adelson-Velskii), (b. 8 January 1922 in Samara, Russia) is a So...
Georgy Maximovich Adelson-Velsky (Гео́ргий Макси́мович Адельсо́н-Ве́льский; name is sometimes transliterated as Georgii Adelson-Velskii), (b. 8 January 1922 in Samara, Russia) is a So...
Hans Berliner
Hans Jack Berliner, a Professor of Computer Science at Carnegie Mellon University, is a former World Correspondence Chess Champion, from 1965–1968.
Hans Jack Berliner, a Professor of Computer Science at Carnegie Mellon University, is a former World Correspondence Chess Champion, from 1965–1968.
Harry Lewis Nelson
Harry Lewis Nelson (born January 8, 1932) is an American mathematician and computer programmer.
Harry Lewis Nelson (born January 8, 1932) is an American mathematician and computer programmer.
Human-computer chess matches
This article documents the progress of significant human–computer chess matches.
This article documents the progress of significant human–computer chess matches.
International Computer Games Association
The International Computer Games Association (ICGA) was founded as the International Computer Chess Association (ICCA) in 1977 by computer chess programmers to organise champio...
The International Computer Games Association (ICGA) was founded as the International Computer Chess Association (ICCA) in 1977 by computer chess programmers to organise champio...
Larry Kaufman
Lawrence C. "Larry" Kaufman is a Grandmaster of chess.
Lawrence C. "Larry" Kaufman is a Grandmaster of chess.
Late Move Reductions
Late Move Reductions (LMR) is a non-game specific enhancement to the alpha-beta algorithm and its variants which attempts to examine a game search tree more efficiently.
Late Move Reductions (LMR) is a non-game specific enhancement to the alpha-beta algorithm and its variants which attempts to examine a game search tree more efficiently.
Los Alamos chess
Los Alamos chess (or anti-clerical chess) is a chess variant played on a 6×6 board without bishops.
Los Alamos chess (or anti-clerical chess) is a chess variant played on a 6×6 board without bishops.
Martin Bryant (programmer)
Martin Bryant is a British computer programmer known as the author of Colossus Chess, a 1980s commercial chess-playing program, and Colossus Draughts, gold medal winner at the 2nd Comput...
Martin Bryant is a British computer programmer known as the author of Colossus Chess, a 1980s commercial chess-playing program, and Colossus Draughts, gold medal winner at the 2nd Comput...
Mathias Feist
Mathias Feist (born 1961 in Germany) is a ChessBase and Fritz programmer.
Mathias Feist (born 1961 in Germany) is a ChessBase and Fritz programmer.
Medieval Kings Chess II
Medieval Kings Chess II (MKC2) is a networked multiplayer chess game developed and published by Magmic Games primarily for mobile devices.
Medieval Kings Chess II (MKC2) is a networked multiplayer chess game developed and published by Magmic Games primarily for mobile devices.
Mikhail Donskoy
Mikhail Vladimirovich Donskoy (Михаил Владимирович Донской), (9 September 1948 – 13 January 2009) was a Soviet and Russian computer scientist.
Mikhail Vladimirovich Donskoy (Михаил Владимирович Донской), (9 September 1948 – 13 January 2009) was a Soviet and Russian computer scientist.
Nolot
Nolot is a chess test suite with 11 very difficult positions from real games.
Nolot is a chess test suite with 11 very difficult positions from real games.
Null-move heuristic
In computer chess programs, the null-move heuristic is a heuristic technique used to enhance the speed of the alpha-beta pruning algorithm.
In computer chess programs, the null-move heuristic is a heuristic technique used to enhance the speed of the alpha-beta pruning algorithm.
Permanent brain
Permanent brain is the act of thinking during the opponent's time in turn-based games.
Permanent brain is the act of thinking during the opponent's time in turn-based games.
Quiescence search
Quiescence search is an algorithm typically used to evaluate minimax game trees in game-playing computer programs.
Quiescence search is an algorithm typically used to evaluate minimax game trees in game-playing computer programs.
Robert Hyatt
Dr. Robert (Bob) Hyatt is an Associate Professor of Computer science at the University of Alabama at Birmingham, in the Department of Computer and Information Sciences (1988-present).
Dr. Robert (Bob) Hyatt is an Associate Professor of Computer science at the University of Alabama at Birmingham, in the Department of Computer and Information Sciences (1988-present).
Smart Game Format
The Smart Game Format (SGF) is a computer file format used for storing records of board games.
The Smart Game Format (SGF) is a computer file format used for storing records of board games.
Stefan Meyer-Kahlen
Stefan Meyer-Kahlen (born 1968 in Düsseldorf) is a German programmer of the computer chess program Shredder.
Stefan Meyer-Kahlen (born 1968 in Düsseldorf) is a German programmer of the computer chess program Shredder.
Swedish Chess Computer Association
The Swedish Chess Computer Association is an organization that tests computer chess software by playing chess programs against one another and producing a rating list.
The Swedish Chess Computer Association is an organization that tests computer chess software by playing chess programs against one another and producing a rating list.
Transposition table
In computer chess and other computer games, transposition tables are used to speed up the search of the game tree.
In computer chess and other computer games, transposition tables are used to speed up the search of the game tree.
Universal Chess Interface
The Universal Chess Interface (UCI) is an open communication protocol that enables a chess program's engine to communicate with its user interface.
The Universal Chess Interface (UCI) is an open communication protocol that enables a chess program's engine to communicate with its user interface.
Variation (game tree)
A Variation can refer to a specific sequence of successive moves in a turn-based game, often used to specify a hypothetical future state of a game that is being played.
A Variation can refer to a specific sequence of successive moves in a turn-based game, often used to specify a hypothetical future state of a game that is being played.
Vasik Rajlich
Vasik Rajlich (born 1971 in Cleveland, Ohio) is an International Master in chess and the author of Rybka, one of the strongest chess playing programs in the world.
Vasik Rajlich (born 1971 in Cleveland, Ohio) is an International Master in chess and the author of Rybka, one of the strongest chess playing programs in the world.
Zobrist hashing
Zobrist hashing (also referred to as Zobrist keys or Zobrist signatures ) is a hash function construction used in computer programs that play abstract board games, such as chess and ...
Zobrist hashing (also referred to as Zobrist keys or Zobrist signatures ) is a hash function construction used in computer programs that play abstract board games, such as chess and ...
Zvonko Vranesic
Zvonko Vranesic is a Croatian–Canadian International Master of chess, and an International Master of Correspondence Chess.
Zvonko Vranesic is a Croatian–Canadian International Master of chess, and an International Master of Correspondence Chess.