Abstract
Each king on an n×n chessboard is said to attack its own square and its neighboring squares, i.e., the nine or fewer squares within one move of the king. A set of kings is said to form an irredundant set if each attacks a square attacked by no other king in the set. We prove that the maximum size of an irredundant set of kings is bounded between (n−1)2/3 and n2/3, and that the minimum size of a maximal irredundant set of kings is bounded between n2/9 and ⌊(n+2)/3⌋2, where the latter upper and lower bounds are in fact equal when n≡0(mod3). Results are given for related domination and independence problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
