A neat puzzle I just saw: You can place a black king anywhere you like on a chessboard of a given size m×n. Where do you place it such that you can place also the maximal number of white queens that do not attack the king? And how many of those queens can you place?
@Rosemary In a corner, I guess, because you rule out one row and one column no matter what, and as far as I can tell you can't do any better than ruling out only one diagonal... So that would leave mn - m - (n - 1) - (min(m, n) - 1) queens
Awoo.space is a Mastodon instance where members can rely on a team of moderators to help resolve conflict, and limits federation with other instances using a specific access list to minimize abuse.
While mature content is allowed here, we strongly believe in being able to choose to engage with content on your own terms, so please make sure to put mature and potentially sensitive content behind the CW feature with enough description that people know what it's about.
Before signing up, please read our community guidelines. While it's a very broad swath of topics it covers, please do your best! We believe that as long as you're putting forth genuine effort to limit harm you might cause – even if you haven't read the document – you'll be okay!