This problem is part of the new Brilliant.org Open Problems Group. The end goal for each open problem is to find a solution, and maybe publish it if it's a nice enough result! Even if we don't make it all the way there, we can have fun exploring unsolved problems and doing real research. This problem is related to an unsolved open problem, which you can read about here.

Place 4 knights and 4 bishops on a chessboard (of any size) such that

- each knight is attacking exactly 2 bishops (and no knights);
- each bishop is attacking exactly 2 knights (and no bishops).

What's the smallest square board on which this is possible?

**Note:** Bishops in chess move diagonally, as shown with blue stars. A chess knight moves in an "L" shape, as indicated with red stars.

×

Problem Loading...

Note Loading...

Set Loading...