FA-86542 / Procedural level generation constraints / Member archive

BSP dungeon partition: Bottom child splits one level deeper · case 02

The bottom half of every horizontal split is over-partitioned.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

Case contract

Recursively split the rectangle while depth remains. An axis can be split when that side is >= 2*min_size; if neither can, it is a leaf. Split vertically when w > h, or when w == h at even remaining depth; if the chosen axis cannot be split use the other. The first child gets floor(side/2). Returns leaves [x, y, w, h] in left/top-first order.

Why this case matters

Procedural generators silently emit unplayable or unfair levels when a single constraint check uses the wrong boundary, axis, neighborhood or update order; the defect is visible in exact generated geometry.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
square at even depth #1	`[[0, 0, 5, 5], [0, 5, 5, 2], [0, 7, 2, 3], [2, 7, 3, 3], [5, 0, 5, 5], [5, 5, 5, 2], [5, 7, 2, 3], [7, 7, 3, 3]]`	`[[0, 0, 5, 5], [0, 5, 5, 5], [5, 0, 5, 5], [5, 5, 5, 5]]`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.