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:

Improved chessboard images via this website using Creative Commons.

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

This site uses Akismet to reduce spam. Learn how your comment data is processed.

## Welcome 2012 – The National Mathematical Year in India

I was very pleased on reading this news that Government of India has decided to celebrate the upcoming…

## Set Theory, Functions and Real Number System

Sets In mathematics, Set is a well defined collection of distinct objects. The theory of Set as a…

## Solving Ramanujan’s Puzzling Problem

Consider a sequence of functions as follows:- $f_1 (x) = \sqrt {1+\sqrt {x} }$ \$ f_2…

## Just another way to Multiply

Multiplication is probably the most important elementary operation in mathematics; even more important than usual addition. Every math-guy…

## 10 Fun puzzles to enjoy today

1st April is a day of fun, humor and enjoyment. Even though, I have lot of fun puzzles on…

## Mathematical Logic – The basic introduction

What is Logic? If mathematics is regarded as a language, then logic is its grammar. In other words,…