Hosted by The Math Forum

Problem of the Week 832

A Small but Omniscient Clergy

Spring 97 Archive || MacPOW Home || Math Forum POWs || Search MacPOW

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.

[Privacy Policy] [Terms of Use]

Home || The Math Library || Quick Reference || Search || Help 

© 1994-2008 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel School of Education.