An algorithm for counting domino tilings of a rectangular chessboard

Abdulkarim M. Magomedov, Serge A. Lawrence

Source record

Source: Crossref

Published: Dec 22, 2025

DOI: 10.13069/jacodesmath.v13i1.335

Open original source ↗

Source abstract

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. Accepted: 23 June 2025

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.