RETROSPECTIVE FUTURE
Labyrinth of Infinity
A field of 2,601 Truchet tiles - each one a quarter-circle obeying a single binary rule.
From this simplicity, chaos. Somewhere inside, a single unbroken curve winds through 982 cells from entry to exit. Every other line closes into a loop and disappears.
The path exists.
Find it.
Full Specification
Technical Parameters
- Dimensions: 4096 × 4096 px
- Resolution: 300 DPI
- Format: JPEG, quality 96
- Print size: ~34.7 × 34.7 cm (13.65" × 13.65")
- Color model: RGB
Palette (3 colors)
- #E8E0D0 - parchment (background)
- #16162A - deep navy (curves, border)
- #C6A024 - antique gold (outer frame, corner ornaments, markers)
Grid
- Algorithm: Truchet tile
- Total cells: 51 × 51 = 2,601
- Cell size: 70 × 70 px
- Line width: 7 px
- Grid offset from canvas edge: 230 px on each side
- Backing texture: single-pixel grid in a lighter background tone
Puzzle Logic
- Generative seed: 602
- Tile type: binary (0 or 1 per cell)
- Type 0: connects North↔West and East↔South
- Type 1: connects North↔East and West↔South
- Entry point: left edge of grid, row **26** (center)
- Exit point: right edge of grid, row **10**
- Length of the single open path: **982 cells**
- All other curves: closed loops
Decorative Elements
- Outer frame: double gold line (16 px + 5 px), inset 54 px from canvas edge
- Inner frame: deep navy line 7 px + thin gold accent line 2 px
- Corner ornaments × 4: diamond + rotated square + center disc + axis cross
- Entry marker: gold arrow (▶) left of grid
- Exit marker: gold 6-point star (★) right of grid
- Grid border gaps at entry and exit points: 16 px clearance
Generation
- Language: Python 3
- Library: Pillow (PIL)
- Seed search: iterative scan 0–10,000 with constraint - exit must be on the right edge, path length > 1/3 of total cells