Академический Документы
Профессиональный Документы
Культура Документы
Richard P. Stanley
A queue problem is a chess problem in which each solution has the same set
of moves, but the order of the moves can vary. The object is to count the
number of solutions. The computation of the number of possible move orders
should be mathematically interesting. The most interesting situation occurs
when this counting problem is equivalent to a known mathematical counting
problem, and we can determine the answer directly from the mathematical
theory. All queue problems composed thus far have been serieshelpmates or
serieshelpstalemates, in which Black makes a series of moves and White one
move. The number of solutions is thus the number of Black move orders;
White always has the same unique move at the end.
Queue problems were introduced by the Finnish composers Eero Bonsdorff,
Arto Puusa, and Kauko Vaisanen, beginning around 1983. These pioneering
problems are collected in [4]. In 199394 the Finnish Chess Problem Society
sponsored an international solving contest for mathematical chess problems,
in which all the problems but one were proper queue problems. This contest featured eight new problems, composed by the above three composers
together with Unto Heinonen.
In this article we present three new queue problems illustrating three theorems from enumerative combinatorics (the mathematical subject dealing with
counting the number of objects with specified properties) not involved in any
previous queue problems. We also give an extension of a classic problem of
Bonsdorff and Vaisanen.
First we discuss a method for describing solutions to queue problems. Consider Problem A. The Black pawn at a5 must play the moves a4-a3-a2-a1Be5-b8-a7, while the a6 pawn plays a5-a4-a3-a2-a1B-e5-b8. White then plays
b76=. The a4 pawn can never pass the a5 pawn (even after promotion).
We depict this situation in Figure 1, which we call the solution poset P .
(Poset is an abbreviation for partially ordered set.) The elements (vertices or points) of P correspond to the moves of Black. The pawn initially
1
Corrected version of 12 September 2005. Problem E was unsound in the original version appearing in Suomen Teht
av
aniekat. The present version has been computer checked
by Mario Richter.
B2b8
B2e5
B1a7
P2a1B
B1b8
P2a2
B1e5
P2a3
P1a1B
P2a4
P1a2
P2a5
P1a3
P1a4
14
13
12
10
11
11
12
10
13
14
2
1
Bg2
Kh1
Kg2
exf1B
Kf3
g1S
dxe2
Ke4
fxg2
cxd3
Kd5
exf3
bxc4
dxe4
(D) R. Stanley
2003
X
n=0
En
xn
= sec x + tan x.
n!
7
Rg6
Bxh1
Bg7
(a)
f2
c5
fg5
d3
7
(b)
3
x3
x5
x7
x9
+ 16 + 272 + 7936 + .
3!
5!
7!
9!
(E) R. Stanley
2004
(1)
0 1i<jn
This integral is a special case of a famous integral due to Selberg and known
as Selbergs integral (e.g., [1, Chap. 8]). Its value is given by
n
1 Y ((j 1)k)!2 (jk)!
I(n, k) = n
.
(2)
k! j=1 ((n j 2)k + 1)!
9
Bc8
13 a34
Bxe6
11 a34
Bxf5
10
Ra8
Ra4
e3
b1B
ab2
a24
g2
e2
9 a23
14
g3
a24
a13
7
8 a23
a3
4 x
a4
3 a12
a5
(a)
1 a12
(b)
10
5 a14
2
a13
12 a14
(n + kn(n 1))!
I(n, k).
n
n! (2k)!( 2 )
16!
I(4, 1)
24 26
= 13621608000
= 54054.
11
1
252000
References
[1] G. E. Andrews, R. Askey, and R. Roy, Special Functions, Encylopedia
of Mathematics and Its Applications 71, Cambridge University Press,
Cambridge/New York, 1999.
[2] G. Kreweras, Sur une classe de probl`emes de denombrement lies au treillis
des partitions des entiers, Cahiers du Bureau Universitaire de Recherche
Operationnelle, Institut de Statistique de lUniversite de Paris, Paris,
1965.
[3] G. Kreweras and H. Niederhausen, Solution of an enumerative problem
connected with lattice paths, European J. Combinatorics 2 (1981), 5560.
[4] A. Puusa, Queue Problems, Finnish Chess Problem Society (Suomen
Tehtavaniekat), 1992.
[5] Results of the international solving contest for mathematical chess problems (1994), Finnish Chess Problem Society (Suomen Tehtavaniekat).
[6] R. Stanley, Enumerative Combinatorics, vol. 1, Wadsworth and
Brooks/Cole, Pacific Grove, CA, 1986; second printing, Cambridge University Press, Cambridge, 1996.
[7] R. Stanley, Enumerative Combinatorics, vol. 2, Cambridge University
Press, New York/Cambridge, 1999.
12