New directions in enumerative chess problems

DSpace/Manakin Repository

New directions in enumerative chess problems

Citable link to this page

. . . . . .

Title: New directions in enumerative chess problems
Author: Elkies, Noam
Citation: Elkies, Noam D. 2005. New directions in enumerative chess problems. Electronic Journal of Combinatorics 11, (2).
Full Text & Related Files:
Abstract: 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.
Other Sources: http://arxiv.org/abs/math/0508645
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:2797454

Show full Dublin Core record

This item appears in the following Collection(s)

  • FAS Scholarly Articles [7219]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
 
 

Search DASH


Advanced Search
 
 

Submitters