The computational challenge of enumerating high-dimensional rook walks

From MaRDI portal
Publication:720594




Abstract: We provide guessed recurrence equations for the counting sequences of rook paths on d-dimensional chess boards starting at (0..0) and ending at (n..n), where d=2,3,...,12. Our recurrences suggest refined asymptotic formulas of these sequences. Rigorous proofs of the guessed recurrences as well as the suggested asymptotic forms are posed as challenges to the reader.





Describes a project that uses

Uses Software





This page was built for publication: The computational challenge of enumerating high-dimensional rook walks

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