Python rewrite of the Urb/Homemaker stack
Find a file
Bruno Postle 2ef2b15fe3 Batched oracle: score many .dom files per perl invocation
oracle.score_batch() writes/cleans N outputs and runs urb-fitness.pl once
with all file names; oracle.score() is now a thin wrapper. Adds
Score.fail_lines (sorted) because Perl hash-order randomisation shuffles
.fails line order between runs, and documents Urb's ~1-ULP score
nondeterminism (compare with rel tolerance, never ==).

experiments/bench_batch_oracle.py validates batch-vs-single parity on the
35-file corpus and benchmarks: 0.98 s/dom batched vs 1.27 s/dom single
(x1.30), all files identical (fitness to 1e-12 rel, exact failure sets).

Closes homemaker-py-av5.
2026-06-12 01:13:55 +01:00
.beads Batched oracle: score many .dom files per perl invocation 2026-06-12 01:13:55 +01:00
.claude Scaffold homemaker-py with validated geometry port 2026-06-10 20:50:20 +01:00
experiments Batched oracle: score many .dom files per perl invocation 2026-06-12 01:13:55 +01:00
src/homemaker Batched oracle: score many .dom files per perl invocation 2026-06-12 01:13:55 +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 Update DESIGN.md with findings from source review of Urb 2026-06-12 00:34:51 +01:00
pyproject.toml Scaffold homemaker-py with validated geometry port 2026-06-10 20:50:20 +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.