Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115229
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115229 Number of ways in chess to force mate in n moves for a single knight against a single pawn, without duals, without short mates and excluding rotations, mirroring and color reversing. +0
1
3, 12, 16, 31, 21, 44, 3, 6 (list; graph; listen)
OFFSET

0,1

COMMENT

The mate is only possible against a pawn on a border line (a-line or h-line).

No non-dual (single solution) mates are possible beyond n = 7 (cf. Springerzauber, page 178).

Obviously the positions with the higher number of moves lead via a unique chain of positions with the lower numbers.

REFERENCES

John Selman and Harrie Grondijs, Springerzauber, 1998, chapter 16.

EXAMPLE

Example: The three positions with 0 moves (checkmate) are:

a) White: Kc2, Nb3, Black: Ka1, Pawn a2

b) White: Kc1, Nb3, Black: Ka1, Pawn a2

c) White: Kc1, Nc2, Black: Ka1, pawn a2

CROSSREFS

Sequence in context: A009783 A064106 A022411 this_sequence A136047 A082965 A045549

Adjacent sequences: A115226 A115227 A115228 this_sequence A115230 A115231 A115232

KEYWORD

nonn

AUTHOR

njas, based on email from Harrie Grondijs (hgrondijs(AT)epo.org), Mar 06 2006

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research