{"slug": "double-agent-finds-chess-position-where-all-63-moves-check-beating-1968-record", "title": "Double Agent finds chess position where all 63 moves check, beating 1968 record", "summary": "Double AI's Double Agent found a chess position, White to move, in which all 63 legal moves give check, surpassing the record of 60 that had stood since 1968, and proved that 64 is impossible. Double Agent also constructed a real 190-ply game from the starting position that reaches the position, using pruning filters, pawn-history reconstruction and a backtracking search guided by a 17-move plan. The result extends the company's work on extremal combinatorics problems.", "body_md": "Blog · Nov 2026\n\n### [Can LLMs redesign themselves as they train?](https://www.doubleai.com/research/can-llms-redesign-themselves-as-they-train)\n\nArchitecture is the last hand-designed piece. We make it part of training.\n\nDouble Agent found a chess position in which all 63 legal moves give check, beating a record that had stood since 1968.\n\nDate\n\nOct 19, 2026\n\nType\n\nBlog\n\nResearch area\n\nPublications\n\nReading time\n\n5 min\n\nHow many legal moves can a chess position have if every single one of them gives check? Since 1968 the record was 60.[1] Double Agent found a position, White to move, with 63, and proved that 64 is impossible. It also found a real game from the starting position that reaches it.\n\nGiven the [enormous state space of chess](https://en.wikipedia.org/wiki/Shannon_number), this takes a combination of high-level chess reasoning and [exhaustive computer search](https://www.doubleai.com/about):\n\n[Extremal combinatorics](https://en.wikipedia.org/wiki/Extremal_combinatorics) asks how far you can push something before it breaks. How many friendships can a group of people have before some three of them are all friends with each other? How many numbers can you pick from 1 to 1,000 before three of them are evenly spaced? The objects that sit right at the edge are called extremal constructions.\n\nWe have pointed Double Agent at problems like these in [graph theory](https://www.doubleai.com/research/advancing-a-decades-old-problem-in-extremal-graph-theory) before. Chess is a beast of its own, and composers have been setting records in it for over a century. This time we chose one of them: a position in which every legal move gives check, with as many legal moves as possible.[2]\n\n*White to move. Each of White's 63 legal moves gives check, and 23 of them are mate.* *Position on Lichess* *·* *the 190-ply game*\n\nFinding the position and finding a game that reaches it are intertwined. Searching over all positions would be pointless, because most of them are blatantly illegal:\n\nSo Double Agent prunes as it searches.\n\nFurther filters reconstruct the history of the pawns. Pawns are predictable: they only move forward, and they change file only when they capture. For each candidate position, Double Agent checks that at least one history makes sense: some way of assigning pawns to starting files, with captures and promotions that add up. Three examples of positions with no such history:\n\nWith these filters in place, only one placement of the kings can still reach 63: Black on c6, White on d3.\n\nWith a likely position in hand, Double Agent has to find an actual game that ends there. Off-the-shelf proof-game solvers such as [Texel](https://github.com/peterosterlund2/texel) get stuck on crowded positions like this one: they estimate how many moves remain by assuming pieces never get in each other's way. So Double Agent combines high-level planning with backtracking search. It first decides which captures and promotions the game must contain, and roughly when. The search then only has to fill in the moves between those milestones.\n\nThe position makes strict demands:\n\nWhite's five captures each do more than one job:\n\nDouble Agent wrote this plan out as the first 17 moves:\n\n1.a3 b5 2.c4 b4 3.axb4 d5 4.cxd5 h5 5.g4 e5 6.gxh5 f5 7.Nf3 c5 8.Nxe5 c4 9.Nf3 g5 10.Nd4 c3 11.Nxf5 g4 12.d3 c2 13.Bd2 g3 14.Bc3 g2 15.e4 g1=Q 16.Nd2 Qg4 17.Be2 c1=Q\n\nBacktracking search, guided by the plan, then fills in the remaining 160 or so plies, walking five new queens and Black's pieces into place. [Full game on Lichess](https://lichess.org/analysis/pgn/1.a3_b5_2.c4_b4_3.axb4_d5_4.cxd5_h5_5.g4_e5_6.gxh5_f5_7.Nf3_c5_8.Nxe5_c4_9.Nf3_g5_10.Nd4_c3_11.Nxf5_g4_12.d3_c2_13.Bd2_g3_14.Bc3_g2_15.e4_g1%3DQ_16.Nd2_Qg4_17.Be2_c1%3DQ_18.b5_Kd7_19.h4_a5_20.d6_Qgg5_21.b6_a4_22.h6_Qg4_23.b4_Qf6_24.b7_Be7_25.e5_Ra5_26.e6%2B_Kc6_27.d7_Ra7_28.d4_Qfg5_29.h5_Qg3_30.h7_Kb6_31.h6_Q3h4_32.d5_Qh2_33.d6_Qa3_34.Rc1_Nc6_35.Ne4_Bf8_36.e7_Qb2_37.Bd2_Na5_38.Rc2_Qg4_39.Bf3_Qb1_40.Ke2_Nc6_41.Nc3_Qb3_42.Rg1_Qd4_43.Bh1_Nf6_44.Rg2_Ne8_45.Qg1_Na5_46.b8%3DQ%2B_Bb7_47.Ng3_Qg4%2B_48.Kd3_Qb1_49.Bf4_Nb3_50.Bg5_Rg8_51.h8%3DQ_Ra6_52.h7_Bh6_53.Qe5_Qgd1%2B_54.Bd2_Rg4_55.f3%2B_Be3_56.f4_Qh5_57.Qf2_Rh4_58.Qg1_Rh3_59.Qf2_Ra7_60.Qg1_Ka6_61.Qf2_Bd5_62.Qg1_Rb7_63.Qf2_Kb6_64.Qg1_Be6_65.Qa5%2B_Kc6_66.h8%3DQ_Rb6_67.Qhe5_Bg8_68.Nf5_Qh7_69.Qf2_Rb7_70.Qg1_Rc7_71.Qf2_Rc8_72.Qg1_Ng7_73.Qf2_Rf8_74.Qg1_Qdh5_75.Bc1_Ne8_76.Qba7_Rh4_77.Qb8_Bd2_78.Qga7_Be3_79.Bd2_Rh3_80.Bc1_Rf6_81.Bd2_Nd4_82.Bc1_Nf3_83.Bd2_Bf2_84.Bc1_Be1_85.Be3_Qg4_86.d8%3DQ_Bd2_87.d7_Ng7_88.Qe8_Bc1_89.Qf7_Ba3_90.d8%3DQ_Ne8_91.Qed4_Nd2_92.Qe6%2B_Nd6_93.Qee5_Ne8_94.Rf2%2B_Qf3_95.Rg2_Qfd1)\n\nWe prove the impossibility using SAT certificates. The idea is to turn the question into a giant logic puzzle, whose variables are yes/no questions:\n\nThe rules of chess become conditions linking them:\n\nOn top of the rules goes the goal, \"at least 64 legal moves, all of them checks\", which needs many more conditions, since the solver has to count. A [SAT solver](https://en.wikipedia.org/wiki/Boolean_satisfiability_problem) then searches for an assignment satisfying all of them. We split the problem into 7,224 cases, by the squares of the two kings and whether White is in check. Every case is unsatisfiable.\n\nFor each case the solver produced an LRAT proof, which was verified by independent proof checkers. Together the proofs come to about 5 TB and took 126 core-hours to produce.\n\n[1] Per the one-mover records register ([Einzügerrekorde](http://www.skcaissa.de/einzueger.htm)), maintained by Max Witte.\n\n[2] The position must be reachable: an actual legal game from the starting position has to end there. A promotion counts as four moves, one per piece, as is standard.\n\nKeep reading\n\nThe first Code Execution Model. An agent of the machine.", "url": "https://wpnews.pro/news/double-agent-finds-chess-position-where-all-63-moves-check-beating-1968-record", "canonical_source": "https://www.doubleai.com/research/maxwell-chess-record-63-checks", "published_at": "2026-11-22 09:39:49+00:00", "updated_at": "2026-11-22 10:11:44.339303+00:00", "lang": "en", "topics": ["artificial-intelligence", "ai-research"], "entities": ["Double AI", "Double Agent", "Texel", "Lichess"], "also_reported_by": [], "takeaway": "Double Agent raised the maximum number of checking moves in a legal chess position from 60 to 63 and proved 64 impossible, pairing exhaustive search with pawn-history filters and plan-guided backtracking to build a 190-ply proof game.", "recommendation": null, "alternates": {"html": "https://wpnews.pro/news/double-agent-finds-chess-position-where-all-63-moves-check-beating-1968-record", "markdown": "https://wpnews.pro/news/double-agent-finds-chess-position-where-all-63-moves-check-beating-1968-record.md", "text": "https://wpnews.pro/news/double-agent-finds-chess-position-where-all-63-moves-check-beating-1968-record.txt", "jsonld": "https://wpnews.pro/news/double-agent-finds-chess-position-where-all-63-moves-check-beating-1968-record.jsonld"}}