Search results
Results from the WOW.Com Content Network
The queen (♕, ♛) is the most powerful piece in the game of chess. It can move any number of squares vertically, horizontally or diagonally, combining the powers of the rook and bishop. Each player starts the game with one queen, placed in the middle of the first rank next to the king.
In chess, a back-rank checkmate (also known as a corridor mate) is a checkmate delivered by a rook or queen along the opponent's back rank (that is, the row closest to them) in which the mated king is unable to move up the board because the king is blocked by friendly pieces (usually pawns) on the second rank.
The triangle mate involves a queen, supported by a rook on the same file two squares away, delivering checkmate to a king that is either at the edge of the board or whose escape is blocked by a piece; the queen, rook, and king together form a triangular shape, hence the name of the mating pattern.
Browne could have won the rook or checkmated in 31 moves with perfect play. After 45 moves, Browne realized that he would not be able to win within 50 moves, according to the fifty-move rule. [5] Browne studied the endgame and, later in the month, played another game from a different starting position.
The staircase maneuver (or staircase movement [1]) is a tactical motif that employs the idea of a series of checks, or alternation between pins and checks, to advance a queen, rook, or king along a diagonal via a series of stepped orthogonal moves.
Yuri Averbakh pointed out that the opposition is a means to an end; the end is penetration to a key square. [9] This can be a square in front of a pawn, so the king can lead it to the queening square, or into a critical zone to win an enemy blocked pawn. In the diagram, White should play 1. Kc5. Taking the opposition by 1.Ke4 merely draws.
The example here is a study by Henri Rinck first published in La Stratégie in 1920. It is White to play and win. Normally, Black would be able to sacrifice his rook for the white bishop, leaving a drawn position (sacrificing it for a knight would be no good, since it is possible to force mate with bishop and knight), but in this case it turns out that the rook is dominated, and its capture ...
An independence problem (or unguard [2]) is a problem in which, given a certain type of chess piece (queen, rook, bishop, knight or king), one must find the maximum number that can be placed on a chessboard so that none of the pieces attack each other. It is also required that an actual arrangement for this maximum number of pieces be found.