Hosted by The Math Forum


Problem of the Week 832

A Small but Omniscient Clergy

What is the fewest number of bishops you can place on a 5x12 chess board so that they attack all squares? Remember, bishops can only move diagonally.

Source: Dave Fisher (Univ. of Colorado-Denver)


See Jeff Erickson's solution.

© Copyright 1997 Stan Wagon. Reproduced with permission.

The Math Forum

2 October 1998