New answers tagged optimization
4
The fruits of my labor:
Extension to larger grids:
Improvement, possibly optimal:
8
To kick this thing off, I've got:
EDIT: I've come across useful patterns that provide good answers for even $n$ greater than 6:
Imgur Link
3
Black can stalemate in move
White's job here is moving their pieces such that black can capture almost every move while bringing their pieces into the final position.
Final position:
4
Turns out that the optimal solution has been known since 1991. The answer is we need
$$\left\lceil\frac{7n}{6}\right\rceil$$
gloves to have $n$ doctors operating on $n$ patients without the risk of infecting each other. This number is optimal.
Ilan Vardi published it in chapter 10 of Computational Recreations in Mathematica (Addison-Wesley). Both the proof ...
3
13 moves (25 ply): 1. e3 a5 2. Qh5 Ra6 3. Qxa5 h5 4. h4 Rah6 5. Rh3 f6 6. Qxc7 Kf7 7. Rf3 d5 8. Qxb8 Bf5 9. Qxb7 Bh7 10. Qxd5+ Qxd5 11. Rf5 Qc4 12. Bxc4+ Kg6 13. Be6 1/2-1/2
I started off with the well-known stalemate (without queen exchange) in 10 moves, composed by Sam Loyd (see this chess.com post). In that final stalemate position, the role of the queen ...
8
Black can mate in
moves
Animation:
Old answer:
Two more in
and
4
I don't know if this is the quickest way, but here's a mate in 6:
c4 c5 2. Nc3 Nc6 3. Qb3 Qb6 4. Qxb6 axb6 5. Nb5 Nd8 6. Nc7# 1-0
4
The answer is
Reasoning
Then
In particular
The 2nd number
And since
Top 50 recent answers are included