Reconstruction of domino tilings - Combinatorial and probabilistic questions

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

"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.

Cite

CITATION STYLE

APA

Bar-Sinai, Y., & Berend, D. (2016). Reconstruction of domino tilings - Combinatorial and probabilistic questions. Discrete Applied Mathematics, 198, 1–19. https://doi.org/10.1016/j.dam.2015.06.015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free