Consider a tiling of the plane using tiles of at least two types (e.g, a Penrose tiling such as that shown at the bottom of this question, which tiles the plane with two types of tiles). List the tile types as $t_1,\ldots,t_k$. Say that an {\em animal} using tiles $t_1,\ldots,t_k$ is a connected subset of the plane that can be obtained by gluing a finite number of tiles together along their edges; identify congruent subsets. If there is only one type, this is often called a polyomino; here are some pictures of polyominos in the square lattice (which has only one type of tile).

Say that a tiling of the plane using (distinct) tiles $t_1,\ldots,t_k$ is universal if it contains every possible lattice animal using tiles $t_1,\ldots,t_k$. To explain what I mean by "possible", if one of the tiles is the thin diamond from the Penrose tiling, then by gluing together four thin diamonds one can obtain the following "animal"

This animal can't be contained within any tiling using the two Penrose tiles below. So it makes sense to restrict to animals which, for example, are contained within some tiling of the plane with the given tiles.

My question is: are there $k \geq 2$ for which universal tilings exist?

We can also restrict the allowed animals. For example, we could restrict to animals which exhibit some form of symmetry.

One could then ask: do tilings exist which are universal for animals in a (non-trivial) restricted class? Are there any interesting results along these lines? Is the Penrose tiling itself known to be universal for some interesting class of animals?