An algorithm for counting domino tilings of a rectangular chessboard
A recursive method is developed for counting domino tilings of a rectangular chessboard (the dimer problem). Based on this method, a new and enhanced recursive algorithm is proposed for solving this problem. Close connections with Fibonacci numbers are traced out.
Authors
- А. М. Магомедов (ORCID: https://orcid.org/0000-0002-2482-1239)
- Sharon Lawrence
Institutions
- Dagestan State University (RU)
- Russian State University of Tourism and Service (RU)
Publication Details
- Journal
- Journal of Algebra Combinatorics Discrete Structures and Applications
- Published
- 2025-12-22
- DOI
- https://doi.org/10.13069/jacodesmath.v13i1.335
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- University of Central Missouri