All Questions
4
questions
11
votes
0
answers
171
views
What is the current best algorithm to find if a simply connected region is uniquely tileable with dominoes?
I was reading both Thurston's and Fournier's papers on algorithms which detect whether or not a simply connected region is tileable using dominoes (1 by 2 rectangles) when I came across the section in ...
- 425
3
votes
2
answers
191
views
Guaranteed graph labyrinth solving sequence
Starting from a vertex of an unknown, finite, strongly connected directed graph, we want to 'get out' (reach the vertex of the labyrinth called 'end'). Each vertex has two exits (edge which goes from ...
- 53
1
vote
1
answer
333
views
Generating all possible Domino tilings on a $4 \times 4$ grid
I have a task to write a program which generates all possible combinations of tiling domino on a $4 \times 4$ grid. I have found many articles about tilings, but it is for me quite difficult and I ...
- 11
3
votes
1
answer
552
views
Cube nets hexomino tilings.
I am looking for an $\approx12\times12$ rectangle (small holes and small obtrusions are okay) made entirely of cube net hexominos.
It is my understanding that perfect rectangles, in general, are not ...
