Permanent brain

Last updated

In turn-based games, permanent brain (also called pondering) 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.

Use with chess programs

The strength of chess programs depends very much on the amount of time allocated for calculating. Many chess programs use pondering to improve their strength. Current programs cannot create strategic plans, so a program simply tries to predict the opponent's move and begins to calculate its response. If the opponent's move has been guessed correctly, then the program continues to calculate. If the prediction fails, the program begins a new computation.

Pondering is less effective than normal thinking. For example, if the program guesses 25% of the opponent's moves correctly, the use of pondering is on average equivalent to increasing the normal calculating time by a factor of 1.25.

In chess games between two computers, pondering makes sense only if the competing chess engines use separate processors or cores. If they share the same core, the pondering program steals half of the time from the program thinking in the normal way and uses the stolen time less effectively. For this reason, chess GUIs have an option to turn the permanent brain off.

Related Research Articles

<span class="mw-page-title-main">Chess</span> Strategy board game

Chess is a board game for two players. It is sometimes called Western chess or international chess to distinguish it from related games such as xiangqi and shogi. The current form of the game emerged in Spain and the rest of Southern Europe during the second half of the 15th century after evolving from chaturanga, a similar but much older game of Indian origin. Today, chess is one of the world's most popular games, played by millions of people worldwide.

<span class="mw-page-title-main">Deep Blue (chess computer)</span> Chess-playing computer made by IBM

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 three games and drawing one. Deep Blue's victory is considered a milestone in the history of artificial intelligence and has been the subject of several books and films.

<span class="mw-page-title-main">Computer chess</span> Computer hardware and software capable of playing chess

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.

This glossary of chess explains commonly used terms in chess, in alphabetical order. Some of these terms have their own pages, like fork and pin. For a list of unorthodox chess pieces, see Fairy chess piece; for a list of terms specific to chess problems, see Glossary of chess problems; for a list of named opening lines, see List of chess openings; for a list of chess-related games, see List of chess variants.

<span class="mw-page-title-main">Computer Go</span> Field of artificial intelligence around Go computer programs

Computer 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. Many of the algorithms such as alpha-beta minimax that performed well as AIs for checkers and chess fell apart on Go's 19x19 board, as there were too many branching possibilities to consider. Creation of a human professional quality program with the techniques and hardware of the time was out of reach. Some AI researchers speculated that the problem was unsolvable without creation of human-like AI.

<span class="mw-page-title-main">Chess engine</span> Computer program for chess analysis and game

In computer chess, a chess engine is a computer program that analyzes chess or chess variant positions, and generates a move or list of moves that it regards as strongest.

<span class="mw-page-title-main">Zappa (chess)</span> Chess software

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.

In two-player sequential games, a ply is one turn taken by one of the players. The word is used to clarify what is meant when one might otherwise say "turn".

<span class="mw-page-title-main">Kotok-McCarthy</span> Early computer chess program

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.

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.

This article documents the progress of significant human–computer chess matches.

<span class="mw-page-title-main">Chess tournament</span> Series of competitive chess games

A chess tournament is a series of chess games played competitively to determine a winning individual or team. Since the first international chess tournament in London, 1851, chess tournaments have become the standard form of chess competition among serious players.

<i>Beagle Bag</i> Apple II game collection

Beagle Bag is a collection of video games for the Apple II family of computers published in 1982 by Beagle Bros Software. In common with their other titles, the Beagle Bag software was released in unlocked and unprotected form, and is now in the public domain.

ChessGenius is the name of a chess-playing computer program written by Richard Lang who has in the past written programs that have won the World Computer Chess Championship on 10 occasions.

In chess played with a time control, time trouble, time pressure, or its German translation Zeitnot, is the situation where a player has little time to complete the required moves. When forced to play quickly, the probability of making blunders is increased, so handling the clock is an important aspect of chess playing. The last move of the time control is especially prone to blunders if players only have a few seconds to play it, and many games have been lost due to poor time management in time pressure.

Opening book is often used to describe the database of chess openings given to computer chess programs. Such programs are quite significantly enhanced through the provision of an electronic version of an opening book. This eliminates the need for the program to calculate the best lines during approximately the first ten moves of the game, where the positions are extremely open-ended and thus computationally expensive to evaluate. As a result, it places the computer in a stronger position using considerably less resources than if it had to calculate the moves itself.

<i>Kasparovs Gambit</i> 1993 video game

Kasparov's Gambit, or simply Gambit, is a chess playing computer program created by Heuristic Software and published by Electronic Arts in 1993 based on Socrates II, the only winner of the North American Computer Chess Championship running on a common microcomputer. It was designed for MS-DOS while Garry Kasparov reigned as world champion, whose involvement and support was its key allure.

Computer Arimaa refers to the playing of the board game Arimaa by computer programs.

<i>Turochamp</i> Video game

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