Replace the direction-snapping approach (which broke N>6 and N=5) with:
1. Place N corners as a true regular N-gon in Cartesian space (radius =
sideLength), then snap each to the nearest hex via cube-coordinate
rounding (CartToHex / CubeRound).
2. Draw each edge with cube-space lerp (HexLine): interpolate in cube
coords and round at each step, producing the canonical hex-lattice
line between any two tiles regardless of direction.
3. Flood-fill from (0,0) with the edge tiles as walls.
4. Mark absent all in-bounds tiles outside the filled region.
This correctly handles all N in [3,10] without direction quantisation
or bridging hacks.
Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>