A skeleton model to enumerate standard puzzle sequences
DOI10.3934/ERA.2022010zbMATH Open1486.05015arXiv2106.09471OpenAlexW4206486261MaRDI QIDQ2127482FDOQ2127482
Jiaxi Lu, Yuanzhe Ding, Shishuo Fu
Publication date: 20 April 2022
Published in: Electronic Research Archive (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.09471
Recommendations
- The enumeration of standard puzzles
- Refinements on an enumeration scheme for solving a pattern sequencing problem
- Enumerating solutions to grid-based puzzles with a fixed number of rows
- A characterization of achievable patterns of the MN-puzzle problem
- A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles
- A general method of solving Smullyan's puzzles
- Solution sequences for the keyboard problem and its generalizations
- scientific article; zbMATH DE number 1380741
- scientific article; zbMATH DE number 1923055
- An optimal algorithm for Reve's puzzle
Catalan numberenumerationhypergeometric seriesbijective combinatoricsdouble factorialsecant numberstandard puzzle
Directed graphs (digraphs), tournaments (05C20) Classical hypergeometric functions, ({}_2F_1) (33C05) Exact enumeration problems, generating functions (05A15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new class of \(q\)-Fibonacci polynomials
- Catalan Numbers
- Title not available (Why is that?)
- Bijections for Entringer families
- Title not available (Why is that?)
- DOUBLOONS AND NEW Q-TANGENT NUMBERS
- The \((t,q)\)-analogs of secant and tangent numbers
- More bijections for Entringer and Arnold families
- Some properties of the Fibonacci sequence on an infinite alphabet
Uses Software
This page was built for publication: A skeleton model to enumerate standard puzzle sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127482)