Python rewrite of the Urb/Homemaker stack
Find a file
Bruno Postle 511c86c4dc Fix cma convergence test: assert basin convergence, not final-digit polish
The sigma-ladder default splits the budget into restart phases, so a
400-eval run reaches ~0.996 on the smooth test objective rather than
0.999+. Test now matches the component's contract. (Previous commit
landed with this failing because piping pytest to tail masked its exit
code.)

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
2026-06-12 09:46:13 +01:00
.beads Fix cma convergence test: assert basin convergence, not final-digit polish 2026-06-12 09:46:13 +01:00
.claude Scaffold homemaker-py with validated geometry port 2026-06-10 20:50:20 +01:00
experiments Geometry inner loop: batched full-objective ratio optimiser (CMA-ES) 2026-06-12 09:42:24 +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 Descope occlusion/daylight: disable in Urb, port simple crinkliness only 2026-06-12 08:31:20 +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.