New directions in enumerative chess problems
The electronic journal of combinatorics, The Stanley Festschrift volume, Tome 11 (2004) no. 2
Normally a chess problem must have a unique solution, and is deemed unsound even if there are alternatives that differ only in the order in which the same moves are played. In an enumerative chess problem, the set of moves in the solution is (usually) unique but the order is not, and the task is to count the feasible permutations via an isomorphic problem in enumerative combinatorics. Almost all enumerative chess problems have been "series-movers"$\!$, in which one side plays an uninterrupted series of moves, unanswered except possibly for one move by the opponent at the end. This can be convenient for setting up enumeration problems, but we show that other problem genres also lend themselves to composing enumerative problems. Some of the resulting enumerations cannot be shown (or have not yet been shown) in series-movers.
@article{10_37236_1896,
author = {Noam D. Elkies},
title = {New directions in enumerative chess problems},
journal = {The electronic journal of combinatorics},
year = {2004},
volume = {11},
number = {2},
doi = {10.37236/1896},
zbl = {1077.05006},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1896/}
}
Noam D. Elkies. New directions in enumerative chess problems. The electronic journal of combinatorics, The Stanley Festschrift volume, Tome 11 (2004) no. 2. doi: 10.37236/1896
Cité par Sources :