Proof WritingChallengePigeonhole and Extremal Arguments
Pigeonhole and Extremal Arguments · Challenge problem
What is the largest number of kings that can be placed on a board so that no two attack each other (kings attack all neighbouring squares)?
What is the largest number of kings that can be placed on a board so that no two attack each other (kings attack all neighbouring squares)?