84/110
\begin{frame}{Exercise}
  \begin{exampleblock}{}
    Reduce the following instance of the bounded tiling problem
    to the satisfiability problem.
    \medskip
    
    Types of tiles:
    \begin{center}
      \begin{tikzpicture}[default]
        \tile{0}{0}{g}{b}{r}{b}
        \tile{2}{0}{r}{b}{g}{b}
        \tile{4}{0}{r}{z}{g}{b}
      \end{tikzpicture}
    \end{center}
    
    First row:
    \begin{center}
      \begin{tikzpicture}[default]
        \tile{0}{0}{g}{b}{r}{b}
        \tile{1}{0}{r}{b}{g}{b}
      \end{tikzpicture}
    \end{center}
  \end{exampleblock}
\end{frame}