Home » Featured » Chess Problems

Chess Problems

  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:
  2. No. (…and I’m not pretty sure about this No)

Improved chessboard images via this website using Creative Commons.

About these ads

1 Comment

  1. codemonkees says:

    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 : : :

Got to say something? Leave that here:

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Connecting to %s

Follow

Get every new post delivered to your Inbox.

Join 755 other followers

%d bloggers like this: