Join FunTrivia for Free: Hourly trivia games, quizzes, community, and more!
Fun Trivia
Ask FunTrivia: Questions and Answers
Answers to 100,000 Fascinating Questions
Welcome to FunTrivia's Question & Answer forum!

Search All Questions


Please cite any factual claims with citation links or references from authoritative sources. Editors continuously recheck submissions and claims.

Archived Questions

Goto Qn #


What are the minimum number of bishops needed on a chess board so that every square on the chess board is protected?

Question #108094. Asked by star_gazer.

gonnzo
Answer has 3 votes
Currently Best Answer
gonnzo
17 year member
766 replies

Answer has 3 votes.

Currently voted the best answer.
Eight.

"The minimum number of bishops needed to occupy or attack all squares on an n×n chessboard is n."

Illustration of board is on cited page.

link http://mathworld.wolfram.com/BishopsProblem.html

Aug 18 2009, 1:22 AM
free email trivia FREE! Get a new mixed Fun Trivia quiz each day in your email. It's a fun way to start your day!


arrow Your Email Address:

Sign in or Create Free User ID to participate in the discussion