The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A281147 a(n) is the maximum number of moves available to one side from a legal chess position with n pieces with promoted pieces allowed. 0
 8, 35, 60, 85, 108, 127 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS For this sequence, unlike A275360, extra pieces from Pawn promotion are allowed in the original positions. For move counts, both of these sequences allow four promotion moves (to Knight, Bishop, Rook, or Queen) per Pawn per promotion square. Clearly a(n) >= A275360(n) for all 2 <= n <= 32. Additional terms, positions, and proof games showing the legality of the positions -- especially for the larger n -- are desired for both of these sequences. - Rick L. Shepherd, Dec 31 2017 LINKS EXAMPLE White has 8 + 27 + 25 + 25 + 23 = 108 possible moves in the legal position with White King on b5, White Queens on c7, d4, e6, and f3, and Black King on g5. Because there are 6 total pieces on the board and no other legal position with 6 pieces has more than 108 moves available for one side, a(6) = 108. CROSSREFS Cf. A275360. Sequence in context: A316308 A317263 A275360 * A217187 A214725 A136016 Adjacent sequences:  A281144 A281145 A281146 * A281148 A281149 A281150 KEYWORD nonn,fini,more AUTHOR Rick L. Shepherd, Jan 15 2017 STATUS approved

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

Last modified December 6 22:42 EST 2021. Contains 349567 sequences. (Running on oeis4.)