I am seeking a reference/citation for the undecidability of the following (or a similar) tiling problem. While proving its undecidability seems to be an (under)graduate student exercise, I would like to avoid writing a detailed proof (if possible).
Let $\mathrm{T}$ be a finite set of tiles, $\mathrm{H} \subseteq \mathrm{T} \times \mathrm{T}$ be the horizontal matching relation, $\mathrm{V} \subseteq \mathrm{T} \times \mathrm{T}$ be the vertical matching relation, and let $\Box, \blacksquare \in \mathrm{T}$ be different distinguished tiles (called the final tile and the initial tile, respectively). By an $\mathrm{N}$-octant (or an $\mathrm{N}$-triangle) $\mathbb{O}$ we mean the set $\{ (n,m) \in \mathbb{N}^2 \mid m \leq n \leq \mathrm{N} \}$. A tiling of an $\mathrm{N}$-octant $\mathbb{O}$ is any function $\xi\colon \mathbb{O} \to \mathrm{T}$ such that:
- for all $n < \mathrm{N}$ and $(n,m) \in \mathbb{O}$ we have $(\xi(n,m), \xi(n{+}1,m)) \in \mathrm{H}$,
- for all $m < \mathrm{N}$ and $(n,m) \in \mathbb{O}$ we have $(\xi(n,m), \xi(n,m{+}1)) \in \mathrm{V}$,
- $\xi(0,0) = \blacksquare$, and
- $\xi(\mathrm{N},\mathrm{N}) = \Box$.
In the finite octant tiling problem we ask, given an input $(\mathrm{T}, \mathrm{H}, \mathrm{V}, \Box, \blacksquare)$, whether there exists a tiling of $\mathrm{N}$-octant for some positive $\mathrm{N}$.