The usual tiling problem determines which polygons can be used to cover the plane exactly without overlaps or gaps. We consider two variations of that problem. The first attempts to determine polygons that can tile the plane by reflections as in a kaleidoscope. The second determines polygons that can be used to create polyhedral stampers that produce a tiling of the plane by rotation along any edge.