# Determining if a set of hexagons on a grid can tile the plane

Suppose I have a regular grid of identical hexagons that tile the plane, that is a hexagonal lattice.

How can I determine if a connected subset of these hexagons (i.e. a poly-hex) can tile the plane by translations that form a (Bravais) lattice? For reference, here is a picture:

The four shapes on the right can tile the plane, while the left-most shape cannot.

-
You mean just translations, no rotations allowed? That may be decidable. – Will Jagy Mar 12 '13 at 4:14
That is correct, only translations, and no rotations. Not only that, but the overall tiling should be periodic. – Victor Liu Mar 12 '13 at 5:01
The polyhexes that tile by translation, up to order 9, can be found by links from polyomino.org.uk/mathematics/polyform-tiling --- e.g., there are 6572 polyhexes of order 9, of which only 387 tile by translation. There are also references there to the literature. See also mysite.verizon.net/vze16nctz/Tilings/Article/planar.ps – Gerry Myerson Mar 12 '13 at 5:04