# Tag Info

50

I think this arrangement works for the bonus question:

46

I think this will do it

32

Building on samm82's answer, and fixing the French fashion designer answer as Enigma said, you get As Graylocke observed, Removing every other letter reveals i.e. the solution is Edit: just realised:

29

First solution - 50 moves Second solution - 59 moves Current solution - 66 moves (beaten by Retudin - 70 moves and Rewan Demontay - 139 moves) Moves:

25

Since we are talking about a standard game of chess (although with both players co-operating), we know that there are four pieces that cannot possibly make a capture in the series: the two bishops on the wrong coloured squares one of the kings (the other can be the last to capture) the first piece that gets captured (cannot be any of the above). ...

25

This answer was a group effort between @Graylocke, @berkeleybross, and myself, with a little confirmation from @Enigma, so I'm more than happy to make this a community wiki answer (unless there are any objections or @Stiv wants the +2 rep for accepting XD). The answers to the questions: What you should have done is

24

Eeny meeny myny moo (or however you want to spell that)

24

I have a computer program for solving packing problems, and found a way to use it to solve this problem. One of the solutions it found is below: Note that this is very close to the attempted solution in the question, as it differs only in the top left quadrant. Modelling the problem in this way will not find all solutions (I'd need to allow other tile ...

21

Vepir has helped twice in this answer, first in spotting a mistake and then with an improvement in the number of moves. Please got upvote their answer too if you like this one. Here is a position with This position can easily be reached in

20

I used integer linear programming to minimize the number of unattacked squares. Here is one optimal solution (unique up to symmetry), with

17

This is also (one would hope) not the intended answer, but I'll go with the garbagious That would be because to my eye white can only win by after which there are a lot of transformers, as The sequence seems forced: white wins this way, and any deviation from black leads to being down a queen. After this, the white king will step to b2, confining the ...

16

Reasoning: More reasoning as to the number of queens:

14

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 ...

14

Answer Mate in 4 moves: Answer for the cryptarithm: That is, using the FEN notation, The third part means:

14

It is Replay

14

Score: Position: Moves: Fun fact,

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

This should do it: White is in zugzwang, so black has

13

I don't know if this is the right answer, but it seems... plausible? So... What does this mean?

12

I can do Could we do better?

12

I think this could be: As:

12

First things first: let's check the divisibility. There are 64 squares, and the knight is standing in one of them. That leaves 63 squares to cover, and each move covers 3 squares, so that seems to work out. That means, however, that we won't be able to create a closed loop, so every solution we find only solves the puzzle for the starting point and, by ...

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

11

This position: requires the following 40 moves to move the king from a1 to b7: As a bonus, the White king is alone (fits the 'solitaire' theme'), the position is legal, and it doesn't use promoted pieces. The pawn on a5 and the bishop on h7 aren't even necessary, so there's probably room for some optimization.

11

I can do and this is clearly optimal, because Picture of solution.

10

Stealing ideas from Sleafar's first solution, I got to 62 moves. So hopefully someone can better that with the magic 64 or more. EDIT: Since 62 is beaten by Sleafar, I'll up my score to 70: Earlier I failed to realize a8 could just be a pawn; freeing up a bishop

10

This is beautiful. I think we start with: At this point, The next move: Where do we stand? Next move: Here, Now for the finishing touch: Final position:

9

9

13 moves: 12½: Try it online!

9

Addendum #2: With @Retudin's suggestion of placing an additional Black pawn on the bank tank, to the 129-mover, and my idea of moving around a few pieces, we have here a new record of 135 moves, with the king starting in check. The solution is still inherently the same, so there is no need to put it in. Further Edit: Since there is no need for a unique ...

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