The variegation problem is to color the cells of the grid with
as few colors as possible so that a given polyform, no matter where it lies
on the grid, has cells of all different colors.
Polyiamond
Variegation.
Color the cells of the polyiamond plane so
no copy of a polyiamond has duplicate colors.
Polyhex
Variegation.
Color the cells of the polyhex plane so
no copy of a polyhex has duplicate colors.
