Search results
Results From The WOW.Com Content Network
In chess, a pin is a tactic in which a defending piece cannot move out of an attacking piece's line of attack without exposing a more valuable defending piece. Moving the attacking piece to effect the pin is called pinning ; the defending piece restricted by the pin is described as pinned .
The computer may make a poor move because it is unable to see the consequences even one ply beyond its maximum search depth. The horizon effect was a major problem in the early years of computer chess, but it is less of an issue today as modern chess engines can search many moves deep even in complex positions. See horizon effect. iterative ...
Board representation in computer chess is a data structure in a chess program representing the position on the chessboard and associated game state. [1] Board representation is fundamental to all aspects of a chess program including move generation, the evaluation function, and making and unmaking moves (i.e. search) as well as maintaining the state of the game during play.
Relative pin – where the piece shielded by the pinned piece is a piece other than the king, but typically more valuable than the pinned piece. Partial pin – when a rook or queen is pinned along a file or rank, or a bishop or queen is pinned along a diagonal; Situational pin – when a pinned piece is shielding a square and moving out of the ...
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 ...
Also called interposing, this is possible only if the checking piece is a queen, rook, or bishop and there is at least one empty square in the line between the checking piece and the checked king. Blocking a check is done by moving a piece to one such empty square. (The blocking piece is then pinned to the king by the attacking piece.) [2]
The 1952 game between Turochamp (White) and Alick Glennie (Black). After 29 moves, White is one pawn up but about to lose its pinned Queen on the next move. Therefore, White resigns. 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 ...
The International Computer Chess Association is founded by chess programmers to organize computer chess championships and report on research and advancements on computer chess in their journal. Also that year, Applied Concepts released Boris , a dedicated chess computer in a wooden box with plastic chess pieces and a folding board.