Search Results

For reference: One-sided chess: Can you stalemate yourself? Goal: Set up all the white pieces so that no piece has a legal move, as close as possible to a reachable position. … Since captures and promotions are part of a regular game of chess, there is a minimal penalty for each: 1 point per promotion or capture. …

One could make the argument that the 4 pawns on the top row should be promoted, but other than that, 16 white pieces with none attacking each other, with proper bishop placement.

From the bottom up: Three rows of 8 black queens One row of black pawns One row of white pawns Three rows of white queens 224. Because the black pawns attack down and the white pawns attack up, the …

Although I like my first answer, I did also wonder how good I could manage with black and white in their normal positions. The best I've gotten so far uses 16 queens, 4 rooks, 4 bishops and 4 pawns. …

I can manage 34. I haven't gotten better than that. 4 rooks, 14 pawns. 34.

The lone pawn in the previously accepted answer bugged me, so I tried replacing it with a knight and moving some pieces around. I now have: Here's the board

So given the other answers and the comments on them, I have a solution with: The board: The move:

Update: I was looking through old puzzles and saw this one and was always annoyed I couldn't get a 14th queen. So I found a way. 14 queens: Original Answer: I've managed 13 queens. I started in one c …

Following @Konstantin Pfennig's answer, using black and white queens, and squeezing in more, I have:

Having tried various options to get below 9 points, I've been very successful in forcing a checkmate with The end goal is to get black into a position where: Initially, I expect that black will veto …

I used a different approach than Callidus, but ended up at exactly the same target, and made exactly the same mistake. To get the highest possible number of nonsensical games, the ideal situation wou …

Update: This problem can be simplified in the following way: For an $n x n$ board where $n$ is even, make $\frac{n}{4}$ squares that are $2 x 2$. This has $\frac{n^2}{2}$ horizontal and $\frac{n^2} …

I started with a different tactic than the first answer and made it to the same result, but between studying his and tweaking mine, I have now managed The game: General comments on strategy and whet …

This question: How can 3 queens control the white squares? got me thinking... What is the fewest number of queens needed to attack every white square? Rules: Only queens allowed Every white square is …

I found it very hard to only control each square once. Any attempt at limiting the physical number of pieces was turning into an issue. I suspect this can be beaten, but I can manage the whole board i …