login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260954 Longest checkmates in chess with n pieces on board. 0
28, 43, 127, 262, 549 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,1
COMMENTS
Results based on research on the Nalimov and Lomonosov Endgame Tablebases.
The results for 6 and 7 pieces ignore the 50-move rule.
FEN:
3 pieces, 28 moves: 8/8/8/1k6/8/8/K5P1/8 w - - 0 1
4 pieces, 43 moves: 8/5k2/2PK4/5r2/8/8/8/8 w - - 0 1
5 pieces, 127 moves: 8/8/8/8/1p2P3/4P3/1k6/3K4 w - - 0 1
6 pieces, 262 moves: 6k1/5n2/8/8/8/5n2/1RK5/1N6 w - - 0 1
7 pieces, 549 moves: 1n1k4/6Q1/5KP1/8/7b/1r6/8/8 w - - 0 1
LINKS
Wikipedia, Fifty-move rule
EXAMPLE
With 3 pieces on board (n=3) the longest checkmate requires 28 moves. That is with two kings and a pawn. The FEN strings above give the exact placement of the pieces.
CROSSREFS
Sequence in context: A056031 A061826 A326234 * A349495 A169962 A219685
KEYWORD
nonn,more,hard,fini
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 07:11 EDT 2024. Contains 371905 sequences. (Running on oeis4.)