1. In how many ways can two queens, two rooks, one white bishop, one black bishop, and a knight be placed on a standard $ 8 \times 8$ chessboard so that every position on the board is under attack by at least one piece?
    Note: The color of a bishop refers to the color of the square on which it sits, not to the color of the piece.
  2. Can you attack every position on the board with fewer than seven pieces?

Solution

  1. Two ways as follow:
    chess1 - Chess Problemschess2 - Chess Problems
  2. No. (…and I’m not pretty sure about this No)

Improved chessboard images via this website using Creative Commons.

Updated: May 8th, 2015

Gaurav Tiwari

A designer by profession, a mathematician by education but a Blogger by hobby. Loves reading and writing. Just that.

This Post Has 0 Comments

  1. I have an example of 6 queens attacking every position on a chess board (pardon my bad ascii gfx):
    : : : : : : Q :
    : Q : : : : : :
    : : : : : : : :
    : : Q : : : : :
    : : : : : Q : :
    : : : Q : : : :
    : : : : : : : :
    : : : : Q : : :

Leave a Reply

Your email address will not be published. Required fields are marked *