Daniel Berend

Senior Academic

Reconstruction of domino tilings - Combinatorial and probabilistic questions

Yoav Bar-Sinai, Daniel Berend

"Dominosa" is a puzzle game. Before the game begins, the (n+22) domino bones (0,0),(0,1),⋯,(n,n) are placed on an (n+1)×(n+2) grid (constituting a perfect tiling). The domino bones are then being hidden, leaving only the numbers revealed. The purpose of the game is to recover the original tiling of the domino bones. The game raises many questions, such as how various algorithms perform and how many solutions a random puzzle has. In this paper, we study some of these combinatorial, probabilistic and algorithmic questions.

Publication language English
Pages 1-19
Journal Discrete Applied Mathematics
Volume 198
Publication status Published - 10.01.2016

Keywords

Combinatorial puzzle solving
Domino tiling reconstruction

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics
Access to Document
10.1016/j.dam.2015.06.015
Other files and links
Link to publication in Scopus