New directions in enumerative chess problems

MaRDI QIDQ2570993zbMATH OpenFDO

Authors Noam D. Elkies

Publication date 31 October 2005

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0508645, https://eudml.org/doc/125365, http://www.emis.de/journals/EJC/Volume_11/Abstracts/v11i2a4.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

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. 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.

Recommendations

• Counting monomials
• scientific article; zbMATH DE number 3894867
• Chess tableaux
• scientific article; zbMATH DE number 861434
• Some problems of the theory of enumerating the permutations with restricted positions

Cited in

(11)

• On solving the problem of 7-piece chess endgames
• On the asymptotic enumeration of restricted strip arrangements of a chessboard
• Rook endgame problems in \(m\) by \(n\) chess
• Chess tableaux
• The Mate-in-n Problem of Infinite Chess Is Decidable
• scientific article; zbMATH DE number 6500356 (Why is no real title available?)
• scientific article; zbMATH DE number 4033766 (Why is no real title available?)
• scientific article; zbMATH DE number 1124599 (Why is no real title available?)
• Max Euwe's Set-Theoretic Observations on the Game of Chess — Introductory Notes
• scientific article; zbMATH DE number 6957158 (Why is no real title available?)
• AN EXTENSION OF FURSTENBERG’S THEOREM OF THE INFINITUDE OF PRIMES

This page was built for publication: New directions in enumerative chess problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2570993)