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 .
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.
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 ...
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 ...
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 ...
The 0x88 chess board representation is a square-centric method of representing the chess board in computer chess programs. The number 0x88 is a hexadecimal integer (136 10 , 210 8 , 10001000 2 ). The rank and file positions are each represented by a nibble (hexadecimal digit), and the bit gaps simplify a number of computations to bitwise ...
Bitboards allow the computer to answer some questions about game state with one bitwise operation. For example, if a chess program wants to know if the white player has any pawns in the center of the board (center four squares) it can just compare a bitboard for the player's pawns with one for the center of the board using a bitwise AND operation.