Mathematics – Combinatorics
Scientific paper
2005-08-31
Electronic Journal of Combinatorics 11(2) (2004-2005) [Stanley-60 Festschrift], Article #4
Mathematics
Combinatorics
14 pages, including many chess diagrams created with the Tutelaers fonts
Scientific paper
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. This article is based on a presentation given at the banquet in honor of Richard Stanley's 60th birthday, and is dedicated to Stanley on this occasion.
No associations
LandOfFree
New directions in enumerative chess problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with New directions in enumerative chess problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New directions in enumerative chess problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-116864