US EditionThe non-attacking bishops problem
Summary by johndcook.com
This story is only covered by news sources that have yet to be evaluated by the independent media monitoring agencies we use to assess the quality and reliability of news outlets on our platform. Learn more here.1 Articles
1 Articles
All
Left
Center
Right
The non-attacking bishops problem
How many bishops can you place on a chessboard so that no bishop is attacking any other bishop? For a standard 8 × 8 chessboard the answer is 14. In general, for an n × n chessboard the answer is 2n − 2. Here’s one way to place the maximum number of non-attacking bishops. To see that the bishops cannot attack each other, I think it’s helpful to imagine extending the chessboard so that each bishop attacks the same number of squares. Then we can s…
Coverage Details
Total News Sources1
Leaning Left0Leaning Right0Center0Last UpdatedBias DistributionNo sources with tracked biases.
Bias Distribution
- There is no tracked Bias information for the sources covering this story.
Factuality
To view factuality data please Upgrade to Premium
Ownership
To view ownership data please Upgrade to Vantage