Python rewrite of the Urb/Homemaker stack
Find a file
Bruno Postle 5f0c159112 Re-baseline under URB_NO_OCCLUSION: new reference gains, DESIGN §4.7
Corpus: all 35 scores shift (x1.0-1.24, daylight pinned), one expected
failure-set change (458aa8b8 +2 crinkliness), oracle ~8% faster batched.
New deterministic-seed reference gains become the accept_innerloop bars:
x1.63 / x1.70 / x1.68 at budget 400, ~35 oracle calls per topology.
urb-evolve respects the flag by construction (in-process fitness reads
ENV at call time). Old flag-off numbers kept in DESIGN as historical.

Closes homemaker-py-gp2 (Urb-side patch lives in /home/bruno/src/urb,
uncommitted there pending review).

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
2026-06-12 10:31:38 +01:00
.beads Re-baseline under URB_NO_OCCLUSION: new reference gains, DESIGN §4.7 2026-06-12 10:31:38 +01:00
.claude Scaffold homemaker-py with validated geometry port 2026-06-10 20:50:20 +01:00
experiments Re-baseline under URB_NO_OCCLUSION: new reference gains, DESIGN §4.7 2026-06-12 10:31:38 +01:00
src/homemaker Geometry inner loop: batched full-objective ratio optimiser (CMA-ES) 2026-06-12 09:42:24 +01:00
tests Fix cma convergence test: assert basin convergence, not final-digit polish 2026-06-12 09:46:13 +01:00
.gitignore bd init: initialize beads issue tracking 2026-06-11 23:27:11 +01:00
AGENTS.md bd init: initialize beads issue tracking 2026-06-11 23:27:11 +01:00
CLAUDE.md Scaffold homemaker-py with validated geometry port 2026-06-10 20:50:20 +01:00
DESIGN.md Re-baseline under URB_NO_OCCLUSION: new reference gains, DESIGN §4.7 2026-06-12 10:31:38 +01:00
pyproject.toml Geometry inner loop: batched full-objective ratio optimiser (CMA-ES) 2026-06-12 09:42:24 +01:00
README.md Scaffold homemaker-py with validated geometry port 2026-06-10 20:50:20 +01:00

homemaker-py

Programme-driven building-layout search over slicing trees. A clean-room Python successor to the Perl Urb project, intended to eventually be 100% Python.

Why a rewrite

Urb represents a building as a binary slicing tree where room sizes are derived top-down from division ratios. That makes room area an emergent property of every cut above it, which:

  • gives the genome low locality (a cut near the root rescales every descendant),
  • makes target room sizes nearly impossible to hit, so the gaussian size penalty dominates fitness, and
  • defeats crossover (transplanted subtrees lose their proportions).

homemaker inverts this: leaves carry target dimensions from the programme and division ratios are solved bottom-up for a fixed topology. The evolutionary search then only explores topology + types + adjacency.

Phase plan

  1. Solver experiment (current): port Urb's geometry, re-solve ratios from programme targets, score the result against the original via the Perl oracle.
  2. Native Python fitness (retire the Perl oracle).
  3. Canonical slicing encoding (normalized Polish expression) + memetic search.

Layout

  • src/homemaker/dom.py — read/write Urb .dom YAML into a Node tree.
  • src/homemaker/geometry.py — faithful port of Urb's top-down geometry.
  • src/homemaker/programme.py — parse patterns.config space requirements.
  • src/homemaker/solver.py — bottom-up ratio solve (scipy).
  • src/homemaker/oracle.py — Phase-1 scaffold: score a .dom via Urb's urb-fitness.pl.

The Perl oracle is the only throwaway component; everything else is permanent.