April 13, 2026
Rule fights and rectangle roast battles
Shape Grammar
Can rule-made shapes design our homes? The comments are on fire
TLDR: An old-but-powerful way to auto-generate shapes using rules is back in the spotlight, with fans hailing it as LEGO for architects and critics saying it collapses under real-world messiness. The debate boils down to theory vs practicality—and whether this is the grandparent of modern AI design tools.
Shape Grammars—rule sets that auto-draw shapes—just resurfaced like a retro hit, and the internet is brawling about it. Fans call it “LEGO for architects,” pointing to how a few rules can build floorplans or even classical villas. Skeptics clap back: if it’s so great, why isn’t it in your everyday design software? One user deadpanned, “Because real buildings aren’t sudoku.” Ouch.
For the uninitiated: a shape grammar is a recipe. Start with a shape, apply a rule, repeat, then stop—think cookie-cutter for geometry. It can even apply rules all at once, which has nerds flexing that it can simulate a “Turing machine” (translation: it’s theoretically super powerful). Cue the meme flood: “If it’s Turing-complete, can it run DOOM on my kitchen?” Meanwhile, the Wikipedia entry became battleground central.
The biggest flashpoint? Practicality. Pros in computer-aided design say real projects explode into hundreds of rules and edge cases—no wonder it’s still niche. Academics counter that parametric versions (rules with adjustable numbers) can adapt to real conditions like beam widths, and cite iconic examples: “Palladian villas in 69 rules”—which spawned a predictable chorus of “nice.”
Add a side drama: is this the ancestor of AI generative design? One camp argues it’s basically the OG “prompt engineering for geometry.” Another calls it a museum piece. Either way, the thread turned into a reality show: architects vs coders, theory vs jobsite, and a magical “marker” that everyone kept calling a “geometry Post-it.”
Key Points
- •Shape grammars are production systems for generating 2D/3D geometric shapes, introduced by George Stiny and James Gips in 1971.
- •Foundational works (1975) formalized shape grammars and demonstrated their ability to simulate Turing machines.
- •A shape grammar comprises rules with LHS/RHS and a marker, plus a generation engine operating on a Current Working Shape.
- •Rules can be applied serially or in parallel; matching can target all occurrences or a selected occurrence.
- •Parametric shape grammars extend the model by using parameters to adapt forms to context; despite academic interest, shape grammars see limited adoption in generic CAD.