Domino Tiling Problem

This project explores the classic Domino Tiling Problem (Brute Force vs. Divide & Conquer), focusing on tiling a 2×n board with 2×1 dominoes. It is part of a research paper project, with the main algorithm and analysis provided in the included research paper and C++ code.

Features

• Research Paper: Contains a detailed write-up (PDF, LaTeX source) for the domino tiling problem, including both brute-force and divide and conquer approaches.
• Brute-Force Visualizer: An interactive HTML visualizer to demonstrate the brute-force approach for tiling, allowing users to step through the tiling process and see all possible configurations. (Visualizer is for brute-force only.)

Visualizer Screenshot

Research Paper Screenshot

Files

• Tiling-Problem.cpp: C++ implementation of the tiling algorithms (brute-force and divide and conquer).
• Tiling-Problem-IEEE-Conference-Template.tex: LaTeX source for the research paper.
• Tiling_Problem_MIU.pdf: Compiled research paper.
• brute-force-visualization.html: Interactive visualizer for the brute-force approach.

Usage

• Open brute-force-visualization.html in your browser to use the visualizer (brute-force only).
• Refer to the Tiling_Problem_MIU.pdf or Tiling-Problem-IEEE-Conference-Template.tex for the full research paper and algorithmic details.