I'm reading about Wang's tessellation problem and the text mentionsa simpler version: If we consider a finite set of tiles $W_{n}=\{w_{1},...,w_{n}\}$where $n$ is bounded then the claim is that now the problemis in $R$.Of course, after writing this claim the text adds the comment$$\text{(Why ? )}$$which left me thinking about it.I fail to see how $n$ being bounded helps, since $\mathbb{R}^{2}$is still infinite and so this doesn't seem like a finite problem tome. Moreover, given some specific $n$ (not bounded a priory) it seemsthat we could of solved the 'easy' problem with that $n$ thinkingof it as a constant (/bounded).Can someone help me understand the reasoning ?
Simple version of Wang's tessellation problem
computability