Heesch's Problem

How many times can a shape be completely surrounded by copies of itself without being able to Tile the entireplane, i.e., what is the maximum (finite) Heesch Number?

References

Eppstein, D. ``Heesch's Problem.'' http://www.ics.uci.edu/~eppstein/junkyard/heesch/.

• Factor Level
• Factor Ring
• Factor Space
• Fagnano's Point
• Fagnano's Problem
• Fagnano's Theorem
• Fair Game
• Fairy Chess
• Fallacy
• False
• False Position Method
• Faltung (Form)
• Faltung (Function)
• Fan
• Fano Plane
• Fano's Axiom
• Farey Sequence
• Farey Series
• Farkas's Lemma
• Faro Shuffle
• Far Out
• Far-Out Point
• Fast Fibonacci Transform
• Fast Fourier Transform
• Fat Fractal