Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Enumerating solutions to grid-based puzzles with a fixed number of rows

From MaRDI portal
Publication:2163352
Jump to:navigation, search

DOI10.1007/S11786-022-00530-XOpenAlexW4293074640MaRDI QIDQ2163352

George Spahn

Publication date: 10 August 2022

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.06234



Mathematics Subject Classification ID

Computational methods for problems pertaining to combinatorics (05-08)


Related Items (1)

Counting Star-Battle configurations


Uses Software

  • OEIS
  • GitHub



Cites Work

  • The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
  • Unnamed Item




This page was built for publication: Enumerating solutions to grid-based puzzles with a fixed number of rows

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2163352&oldid=14674699"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 00:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki