enow.com Web Search

  1. Ads

    related to: bishop attacks chess board

Search results

  1. Results from the WOW.Com Content Network
  2. Bishop (chess) - Wikipedia

    en.wikipedia.org/wiki/Bishop_(chess)

    The bishop has access to only half of the squares on the board, whereas all squares of the board are accessible to the rook. When unobstructed, a rook attacks fourteen squares regardless of position, whereas a bishop attacks no more than thirteen (from one of four center squares) and sometimes as few as seven (from sides and corners).

  3. Rules of chess - Wikipedia

    en.wikipedia.org/wiki/Rules_of_chess

    Staunton style chess pieces. Left to right: king, rook, queen, pawn, knight, bishop. The rules of chess (also known as the laws of chess) govern the play of the game of chess. Chess is a two-player abstract strategy board game. Each player controls sixteen pieces of six types on a chessboard. Each type of piece moves in a distinct way.

  4. Bishop's Opening - Wikipedia

    en.wikipedia.org/wiki/Bishop's_Opening

    The Bishop's Opening is a chess opening that begins with the moves: . 1. e4 e5 2. Bc4. White attacks Black's f7-square and prevents Black from advancing the d-pawn to d5. By ignoring the beginner's maxim "develop knights before bishops", White leaves their f-pawn unblocked, preserving the possibility of f2–f4.

  5. Eight queens puzzle - Wikipedia

    en.wikipedia.org/wiki/Eight_queens_puzzle

    On an 8×8 board one can place 32 knights, or 14 bishops, 16 kings or 8 rooks, so that no two pieces attack each other. In the case of knights, an easy solution is to place one on each square of a given color, since they move only to the opposite color. The solution is also easy for rooks and kings.

  6. Bishop's graph - Wikipedia

    en.wikipedia.org/wiki/Bishop's_graph

    In mathematics, a bishop's graph is a graph that represents all legal moves of the chess piece the bishop on a chessboard.Each vertex represents a square on the chessboard and each edge represents a legal move of the bishop; that is, there is an edge between two vertices (squares) if they occupy a common diagonal.

  7. Greek gift sacrifice - Wikipedia

    en.wikipedia.org/wiki/Greek_gift_sacrifice

    In chess, the Greek gift sacrifice, also known as the classical bishop sacrifice, is a typical sacrifice of a bishop by White playing Bxh7+ or Black playing Bxh2+ at some point after the opponent has castled kingside, with the goal generally being to attack and checkmate the opponent's king, or to regain material.

  8. Checkmate pattern - Wikipedia

    en.wikipedia.org/wiki/Checkmate_pattern

    The bishop and knight mate is one of the four basic checkmates and occurs when the king works together with a bishop and knight to force the opponent king to the corner of the board. The bishop and knight endgame can be difficult to master: some positions may require up to 34 moves of perfect play before checkmate can be delivered.

  9. Mathematical chess problem - Wikipedia

    en.wikipedia.org/wiki/Mathematical_chess_problem

    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.

  1. Ads

    related to: bishop attacks chess board