Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126685
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126685 In chess, the number of checkmate dual-free proof games in n plies. +0
1
0, 0, 0, 0, 0, 3, 51, 1106, 3813, 47300, 216420, 2057581 (list; graph; listen)
OFFSET

0,6

COMMENT

Among all the proof game problems counted in A090051, this is the number of problems ending in checkmate.

LINKS

F. Labelle, Statistics on checkmate diagrams.

Retrograde Analysis Corner, Shortest Mates in Proof Games.

EXAMPLE

a(5)=3 because there are three checkmate proof games in 5 plies:

1. e4 e5 2. Qh5 Ke7 3. Qxe5#

1. e3 e5 2. Qh5 Ke7 3. Qxe5#

1. e4 f5 2. exf5 g5 3. Qh5#

CROSSREFS

Cf. A090051, A102784.

Adjacent sequences: A126682 A126683 A126684 this_sequence A126686 A126687 A126688

Sequence in context: A045489 A145242 A075869 this_sequence A105639 A003028 A069343

KEYWORD

hard,nonn

AUTHOR

Francois Labelle (flab(AT)cs.berkeley.edu), Feb 13 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 3 22:29 EDT 2009. Contains 160563 sequences.


AT&T Labs Research