# Tag Info

34

25

I saw no implications that we aren't going by standard chess rules. Given that we only allow queens to attack the opposing color I propose:

21

Here is the optimal answer with Shown as knights;

19

If a rectangular piece of chessboard is $a\times b$ squares in size, then its diagonal squared is $a^2+b^2$ and its area squared is $a^2\cdot b^2$, and therefore the quantities $a^2,b^2$ are the roots of the quadratic equation $x^2-D^2x+A^2=0$ where $D,A$ are the diagonal and area. But this is enough to determine $\{a^2,b^2\}$ completely: these values are $\... 18 HTM's answer is very nice and must be what's intended here. But I'm not quite seeing why the puzzle isn't cooked as follows: 17 Note that without their king, White’s plan would be Thus, the aforementioned sequence of moves will The only square White’s king can be in that satisfies the constraint is 17 Here is a solution with 15 knights: I could not find a solution with 14 knights. 15 Following @Konstantin Pfennig's answer, using black and white queens, and squeezing in more, I have: 15 There are 14 Here is my attempt at the solution. I don't have any mathematical proof that this is the minimum no. of knights, but the steps I followed suggest that. In the figures below, the yellow cells denote the knight's location, and the corresponding numbers denote their covering cells. 14 Solution Methodology The first thing to realise is that I got as far as the following The next thing to realise is that The next step involves an assumption made in hope, namely that Checking through those, we see that Checking these with the board we've got so far, we find that Using this, the board becomes Uniqueness? Feedback section Great ... 14 Here is a solution with pieces. The colouring of the empty squares ($2\times2$in white,$4\times4$in yellow,$6\times6$in orange,$8\times8$in red) shows how the pattern generalises to any$2k\times2k$board. For$8\times 8$this solution is optimal. 14 Answer Mate in 4 moves: Answer for the cryptarithm: That is, using the FEN notation, The third part means: 13 13 There are solutions for number of knights on each side equal to 4, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16. For example, here's one for 16: I used integer linear programming, with a binary decision variable$x_{i,j,k}$to indicate if cell$(i,j)$contains a knight of color$k$. For each cell$(i,j)$, let$N_{i,j}$be the set of neighboring cells (one knight's ... 13 Clues Putting it all together 13 It could really be as simple as But it definitely seems very simple. I get the feeling we're missing a lot of context. 13 Looks like after the black king has only bad options: and finally, after we have reached this position: All the escape squares of the black knight are blocked, so it will fall, which brings us to.. This assessment seems accurate, since the white bishop can sacrifice itself to stop black's e-pawn if necessary, after which black is left with a pawn on the ... 12 Here's my go (click to enlarge): The pattern of reds is and the white and black patterns are so it's enough to count half the pieces only. :-) 12 One solution to part A: 12 Knights Bishops Pawns I cannot outdo JMP's answers for Kings and Rooks. 11 Answer Attempt 1 At first I thought This can be achieved as follows, using the same technique as Daniel Mathias previously: Adjusting this a little, we can get After a lot more fiddling around with this, I realised it seems that Attempt 2 I then tried Attempt 3 Finally, the third option is The mistake was 11 11 We can achieve the stated goals if Knight: Bishop (this one was harder): Doing a similar trick with a rook promotion is harder because 11 Rook White to move: Explanation: 11 Are you playing If so, 11 Observation: Implication: Conclusion: 11 Due to the 6, we can place the following few pieces: After a little bit of trial and error from here, I found the solution: 4 is attacked by: 6 is attacked by all but 10 Solution for the$5$x$5$grid Other solutions for the same grid are For the$6$x$6$grid I noted that This leads to this conclusion for the$6$x$6\$ grid

Only top voted, non community-wiki answers of a minimum length are eligible