BISHOPS—GUARDED

Now, how many bishops are necessary in order that every square shall be either occupied or attacked, and every bishop guarded by another bishop? And how may they be placed?

主题：
组合数学 -> 组合几何学 最小值和最大值问题/优化问题 组合数学 -> 着色问题 -> 棋盘着色
来源：
There are no comments yet.
Authentication required

You must log in to post a comment.

Log in