FA-86583 / Procedural level generation constraints / Member archive

L-shaped corridor carving: Vertical-first corridors stop short · case 03

The corridor never enters the target room.

Member previewVariant 3 · 3 implementations · 8 checks per implementation

Case contract

Carve from centre a [x, y] to b. Horizontal-first walks x from ax to bx on row ay, then y from ay to by on column bx; otherwise y first on column ax, then x on row by. Both legs include their endpoints; returns cells [x, y] in walk order without duplicates.

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
regression final leg endpoint #1	`[[7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8]]`	`[[7, 2], [7, 3], [7, 4], [7, 5], [7, 6], [7, 7], [7, 8], [6, 8]]`	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.