Game complexityCombinatorial game theory measures game complexity in several ways: State-space complexity (the number of legal game positions from the initial position), Game tree size (total number of possible games), Decision complexity (number of leaf nodes in the smallest decision tree for initial position), Game-tree complexity (number of leaf nodes in the smallest full-width decision tree for initial position), Computational complexity (asymptotic difficulty of a game as it grows arbitrarily large).
ChessBaseChessBase is a German company that develops and sells chess software, maintains a chess news site, and operates an internet chess server for online chess. Founded in 1986, it maintains and sells large-scale databases containing the moves of recorded chess games. The databases contain data from prior games and provide engine analyses of games, while endgame tablebases offer optimal play in some endgames. ChessBase's Indian YouTube channel ChessBase India has amassed more than a million YouTube subscribers and more than 671 million total views as of November 2022.
Chess endgameIn chess and other similar games, the endgame (or end game or ending) is the stage of the game after the middlegame. The endgame begins when few pieces are left on the board. The line between middlegame and endgame is often not clear, and may occur gradually or with the quick exchange of a few pairs of pieces. The endgame, however, tends to have different characteristics from the middlegame, and the players have correspondingly different strategic concerns.
Evaluation functionAn evaluation function, also known as a heuristic evaluation function or static evaluation function, is a function used by game-playing computer programs to estimate the value or goodness of a position (usually at a leaf or terminal node) in a game tree. Most of the time, the value is either a real number or a quantized integer, often in nths of the value of a playing piece such as a stone in go or a pawn in chess, where n may be tenths, hundredths or other convenient fraction, but sometimes, the value is an array of three values in the unit interval, representing the win, draw, and loss percentages of the position.
Internet chess serverAn Internet chess server (ICS) is an external server that provides the facility to play, discuss, and view the board game of chess over the Internet. The term specifically refers to facilities for connecting players through a variety of graphical chess clients located on each user's computer. In the 1970s, one could play correspondence chess in a PLATO System program called 'chess3'. Several users used chess3 regularly; often a particular user would make several moves per day, sometimes with several games simultaneously in progress.
Computer GoComputer Go is the field of artificial intelligence (AI) dedicated to creating a computer program that plays the traditional board game Go. The field is sharply divided into two eras. Before 2015, the programs of the era were weak. The best efforts of the 1980s and 1990s produced only AIs that could be defeated by beginners, and AIs of the early 2000s were intermediate level at best. Professionals could defeat these programs even given handicaps of 10+ stones in favor of the AI.
Horizon effectThe horizon effect, also known as the horizon problem, is a problem in artificial intelligence whereby, in many games, the number of possible states or positions is immense and computers can only feasibly search a small portion of them, typically a few plies down the game tree. Thus, for a computer searching only five plies, there is a possibility that it will make a detrimental move, but the effect is not visible because the computer does not search to the depth of the error (i.e., beyond its "horizon").
Stockfish (chess)Stockfish is a free and open-source chess engine, available for various desktop and mobile platforms. It can be used in chess software through the Universal Chess Interface. Stockfish has consistently ranked first or near the top of most chess-engine rating lists and, as of April 2023, is the strongest CPU chess engine in the world. Its estimated Elo rating is around 3550 (CCRL 40/15). It has won the Top Chess Engine Championship 14 times and the Chess.com Computer Chess Championship 19 times.
BitboardA bitboard is a specialized bit array data structure commonly used in computer systems that play board games, where each bit corresponds to a game board space or piece. This allows parallel bitwise operations to set or query the game state, or determine moves or plays in the game. Bits in the same bitboard relate to each other by the rules of the game, often forming a game position when taken together. Other bitboards are commonly used as masks to transform or answer queries about positions.
Deep Blue versus Garry KasparovDeep Blue versus Garry Kasparov was a pair of six-game chess matches between then-world chess champion Garry Kasparov and an IBM supercomputer called Deep Blue. Kasparov won the first match, held in Philadelphia in 1996, by 4–2. Deep Blue won a 1997 rematch held in New York City by 31⁄2–21⁄2. The second match was the first defeat of a reigning world chess champion by a computer under tournament conditions, and was the subject of a documentary film, Game Over: Kasparov and the Machine.
