Hot answers tagged

40

Yes, there has been a stalemate in a serious game that is under 30 moves long. According to Tim Krabbe's record site, the fastest such game is 27 moves. [Title "Sibilio-Mariotti, Ravenna 1982"] [fen "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1"] 1. e4 e6 2. Nf3 d5 3. e5 c5 4. b4 cxb4 5. d4 Nh6 6. a3 bxa3 7. c3 Nf5 8. Nxa3 ...


36

Sam Loyd, a famous puzzle composer, created this 10 move, 19 ply, stalemate game over 100 years ago. I found it via Google, in this post by AndersElborg on chess.com. Most black pieces are blocked, which saves some moves because those pieces don't need to be captured. [FEN ""] [StartPly "19"] 1.e3 a5 2.Qh5 Ra6 3.Qxa5 h5 4.h4 Rah6 5.Qxc7 f6 6.Qxd7+ Kf7 7....


24

Assuming you allow promoted material (since you didn't say anything :-), this (on Page 13 of the PDF) is the (unfortunately, extremely unknown) finite record since ages. It shows the record for the longest sequence of only 1 legal move for each side, with use of promoted material. [Title "Karl Scherer, Feenshach 1980, Page 13"] [FEN "BQ4R1/2Q5/3Q4/4Q1pp/...


17

Sir Jeremy Morse, in Chess Problems: Tasks and Records, Introduction, cites this construction by E. Luukonen: [Title "E. Luukonen, Uusi Suomi, 1936"] [fen "kr6/pnPPPPPPPP/P2N4/R7/3BBN2/1Q6/3K3P/6R1 w - - 0 1"] [StartFlipped "0"] All of White's 117 moves lead to mate in 2. White has no mate in 1, but if Black's rook were to move, or if (after White captures ...


16

If you don't mind a bushel of promoted Queens, you can get 14 half-moves . . . [Title "14 forced half-moves to checkmate"] [Fen "3b3k/qqqqq3/rr4NK/7R/5N1Q/7Q/B6Q/7R b - - 0 0"] 1... Rxg6+ 2. Nxg6+ Rxg6+ 3. Kxg6+ Qh7+ 4. Rxh7+ Qxh7+ 5. Qxh7+ Qxh7+ 6. Qxh7+ Qxh7+ 7. Qxh7+ Qxh7+ 8. Rxh7#


16

Three moves. On move 3, Black can crash through with his queen on f2 or d2 via several different squares, forcing White to respond. There is no series of White moves that can prevent all such checks. [FEN ""] 1. Nf3 (1. e3 e5 2. c3 Qf6 3. g3 Qxf2+) 1... c6 (1... e5 2. c3 Qh4 3. e3 Qxf2+) 2. g3 Qa5 (2... Qb6 3. c3 Qxf2+) 3. e3 Qxd2+ *


15

Inspired by Ed Dean's now deleted answer, here is another "infinite loop.” [FEN "8/6p1/1p3pPk/1P3Pp1/1Pp3p1/KpP3P1/1P6/8 - - - 0 0 "]


15

According to this page the shortest known mate by en passant capture is in 5.5 moves (that is, White mates on move 6), and was published by Benko in Chess Live & Review in 1976: [Title "Pal Benko's 5.5 move e.p. helpmate"] [Fen "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w - - 0 0"] 1. e4 e5 2. Qh5 Nc6 3. g4 d6 4. g5 Kd7 5. Bh3+ f5 6. gxf6#


14

Solution by Friedrich Burchard & Friedrich Hariuc (1976) in 96 Half-moves [FEN ""] 1.e4 f5 2.e5 Nf6 3.exf6 e5 4.g4 e4 5.Ne2 e3 6.Ng3 e2 7.h4 f4 8.h5 fxg3 9.h6 g5 10.Rh4 gxh4 11.g5 g2 12.g6 Bg7 13.hxg7 g1=Q 14.f4 h3 15.f5 h2 16.b4 a5 17.b5 a4 18.b6 a3 19.Bb2 Ra7 20.bxa7 axb2 21.a4 b5 22.a5 b4 23.a6 b3 24.c4 h1=Q 25.c5 h5 26.c6 Bb7 27.cxb7 c5 28.d4 c4 29....


13

The same question has also been discussed and answered in the lichess forum, and as mentioned by others already, the answer is 11 half-moves for white and 12 half-moves for black. You might find some interesting examples and additional info there. Not knowing that this problem had already been solved before, I did a brute-force proof back then (see my post ...


12

This sounds like a job for Tim Krabbé, who presents two games with six queens: Szalanczy - Nguyen, Budapest 2009 and Anton - Franco, XXI Elgoibar Magistral 2011. I don't know how many of the participants were grandmasters. There are some other games with 5+ queens at Chess Siberia. Of these, Miton - Benjamin, World Open Philadelphia 2005 definitely features ...


12

Longest known checkmate is in 549 moves, revealed by Lomonosov Tablebases. You can see the game here. Plus, you don't need to say "endgame" explicitly. Longest checkmates come from endgame tablebases already. And it's not possible to build a middlegame tablebase practically, because of the exponential space complexity. Let's say there is a middlegame ...


12

Otto Blathy is famous for his long mate problems. There are different records depending on whether you allow an illegal starting position, or promoted pieces, or minor duals in the solution, so your answer might be anywhere between 257 and 292 moves. This answer on Puzzling.SE shows a construction in 271 moves that is not Blathy, but by Nenad Petrovic. [...


11

After some searching, it seems that this composition is the current record holder. 218 moves; legal position with promotions: R6R/3Q4/1Q4Q1/4Q3/2Q4Q/Q4Q2/pp1Q4/kBNN1KB1 w - - 0 1 Another version of the position (same number of moves): 3Q4/1Q4Q1/4Q3/2Q4R/Q4Q2/3Q4/1Q4Rp/1K1BBNNk w - - 0 1 Bonus: 79 moves (for black); from actual game between Davis and ...


11

This is a famous task, originally tackled by Sam Loyd and only improved a century later. See http://www.chessvariants.com/problems.dir/twokingstask.html, which gives the refinement by Ponzetto: [FEN "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1"] 1.e4 d5 2.exd5 Qxd5 3.Bd3 Qxa2 4.Bxh7 Qxb1 5.Bxg8 Qxc2 6.Bxf7+ Kxf7 7.Rxa7 Qxc1 8.Rxb7 Rxh2 9.Rxb8 ...


11

There are Several reasons for identical games: The fact that we databases and computers allows us to find the best move in known positions. (if both players knows the theory in the same level - it might lead to a known draw). Hence some players might follow a known game between two great players, which might result with identical games. The fact that ...


10

Edit: best known is 96 half-moves by Friedrich Burchard & Friedrich Hariuc (1976). (link to answer) My best score 104 half-moves: [FEN ""] 1.a4 b5 2.a5 b4 3.a6 Bb7 4.axb7 h5 5.bxa8=Q h4 6.g4 h3 7.Bg2 hxg2 8.Ra3 bxa3 9.b4 gxh1=Q 10.e4 a2 11.b5 a1=Q 12.b6 a5 13.b7 d5 14.c4 Nd7 15.c5 Nb6 16.cxb6 Rh5 17.gxh5 g5 18.h6 g4 19.h7 g3 20.h4 a4 21.h5 a3 22.h8=Q ...


10

I've come up with 23, in the following position, with promotions: [Event "?"] [Site "?"] [Date "????.??.??"] [Round "?"] [White "?"] [Black "?"] [Result "*"] [FEN "nb2k3/2p5/1pP5/1Pp5/2P1p1p1/3pPpPp/3P1P1B/4KNBN w - - 0 1"] *


10

Funny task. I think I'm still pretty far from the maximum, but here is a suggestion with 23 men: [Event "?"] [title "Challenge 3, 23 units"] [FEN "NRN1k1bn/QRKpPp2/PPpP1Pp1/2P3Pp/7P/8/7B/8 w - - 0 1"] With black to move, an almost-dishonest trick to reach 25: [title "Challenge 3, BTM, 25 units"] [FEN "BRN1Nkbn/QRKpPp2/PPpP1Pp1/2P3Pp/7P/8/1r6/B7 b - - 0 ...


9

Some cleaning up is required, I think: The number on the website you link to differs from the results published in Bonsdorff et al., Schach und Zahl. Unterhaltsame Schachmathematik. pp. 11–13. There they say that if the 50-move-rule is mandatory the longest possible game (i.e. where both players cooperate to achieve the weird goal of a game of maximal ...


9

You mean like this? [FEN "K1k5/P1Pp4/p2P4/Pp6/P1p5/2P5/8/8 - - - 0 0 "] 1. axb5 axb5 a6 b4 cxb4 c3 b5 c2 b6 c1=Q b7# 1-0 White mates in 6. I guess that's 9 consecutive forced moves. It would be eleven except for black's choice of promotion piece on his fifth move. I don't know if it's a record, and I don't know who composed this classic chess problem. ...


9

If you have a pgn file of chess games you can use the chess query language cql to search it http://www.rbnn.com/cql/. Something like: (match :pgn src.pgn :output queens.pgn (position :piececount [Qq] 3 8)) Should return all games with positions containing 3 to 8 Queens on the board. Edit: The Aquarium interface from chessok has a CQL search ...


9

41 Half moves, not a real game The first possible capture is indeed on the third half-move. After that, a perfect game would be purely captures. By counting the moves which don't involve a capture, you can show how close to a perfect king v king you got. Giving check is bad, unless the opposing king can take a piece while moving out of check (unlikely, if ...


8

I'm not aware of any resources documenting the specific situation you're asking about. The closest available is probably this page from Tim Krabbé's chess records which documents the longest known series of mutual checks, but not ending in checkmate. One of the puzzles from the page could end in checkmate via 14.. Qb7# instead of 14...Bxb7+, so this would ...


8

I got this, which is much shorter: [FEN ""] 1. a4 a5 2. b4 b5 3. c4 c5 4. d4 d5 5. e4 e5 6. f4 f5 7. g4 g5 8. h4 h5 9. bxa5 Bd6 10. axb5 Be6 11. dxc5 Nf6 12. cxd5 O-O 13. fxe5 Rf7 14. exf5 Ra6 15. gxh5 Rb7 16. hxg5 Rbb6 17. bxa6 Nc6 18. axb6 Qe7 19. dxc6 Kh8 20. cxd6 Ng8 21. a7 Qf6 22. gxf6 Ne7 23. b7 Bd7 24. e6 Ng8 25. c7 Kh7 26. f7 Kg7 27. e7 Kf6 28. h6 ...


8

This was published about in the latest entry of Tim Krabbé's Chess Diary. Harry Goldsteen has put some research into this and came up with a position which is reachable only in 185 moves: [FEN ""] [StartPly "371"] 1.a4 g5 2.Ra3 g4 3.h3 g3 4.Rh2 gxh2 5.Nf3 h1=R 6.d3 d5 7.Kd2 e5 8.Nh2 a5 9.Ke3 d4+ 10.Kf3 e4+ 11.Kg3 e3 12.Qd2 exd2 13.Rb3 d1=B 14.Bf4 b5 15.Nd2 ...


8

The game Dann-Kovchan ended with 217...Nc2#. [Title "Matthias Dann-Alexander Kovchan, Dresden Open, Dredsen Germany, 4/8/17"] [FEN ""] 1. e4 c5 2. Nf3 d6 3. d4 cxd4 4. Nxd4 Nf6 5. Nc3 a6 6. Be3 Ng4 7. Bg5 h6 8. Bh4 g5 9. Bg3 Bg7 10. Qd2 Nc6 11. Nb3 b5 12. h4 gxh4 13. Rxh4 Nge5 14. Nd5 Ng6 15. Rh1 Bxb2 16. Rd1 Bg7 17. c4 Rb8 18. c5 Nge5 19. Nf4 Bg4 20. Be2 ...


8

In Tim Krabbe’s chess records, Krabbe gives a game where the Black player promoted four of their pawns, the most one player has ever gotten in a professional game, and only one where it has happened. It is also notable for being one of few games with 6 promotions. The game can also be viewed here at ChessDB.com. [Title "Alena Kubikova-Vaclav Novy, 9th Open,...


8

After going through a list of games with king hunts, I found game at last in which 6 pieces are involved in the mate! [Title "Alexander Alekhine-NN, Simul 34b, Moedling Austria, 3/24/1936"] [FEN ""] [startply "33"] 1. e4 e5 2. d4 f6 3. dxe5 fxe5 4. Qh5+ Ke7 5. Qxe5+ Kf7 6. Bc4+ d5 7. Bxd5+ Kg6 8. Qg3+ Kh5 9. Bf7+ g6 10. h3 Qf6 11. Nf3 Be7 12. Qg4+ Bxg4 13. ...


7

A simpler infinite-loop setting: [FEN "1kb5/1p1p4/1P1P4/8/8/4p1p1/4P1P1/5BK1 w - - 0 1"]


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