SYSTEM_PARAMETERS
PRESETS
ClassicINITIAL_CONDITIONS
-0.10
0.00
100000
RENDER_CONTROLS
1.0
1.5
0.60
x(n+1) = 1 − y(n) + |x(n)|
y(n+1) = x(n)
LIVE_RENDER // CANVAS
LIVE_RENDER
DATA_LOG: GINGERBREADMAN_MAP
The Gingerbreadman map is a piecewise-linear discrete-time system with a single absolute-value term — a simple rule that builds a complex fractal-like “gingerbread” silhouette. There are no free shape parameters: the orbit is driven by the initial condition (x0, y0) and how long you iterate. Nearby starts can separate even though the rule never changes; the effect is milder than maps like Lorenz or Hénon, so think fractal silhouette and discrete iteration rather than strong strange-attractor chaos. Runaway coordinates are rare for in-range ICs, but the renderer still guards non-finite and oversized points.