Exhibition control · Hall 2 · Bay plan

Prism Freight Pavilion

Six freight exhibits, six bays, one shared state. Place the hall by hand, then let an exact solver check all 720 arrangements and name the cheapest legal floor — or the smallest rule relaxation standing in the way.

Bays
6
Assignments
720
Soft rules
6

01 · Floor plan

Top-down pavilion

Floor legal

Bays 1–3 run left to right on the top row; bays 4–6 on the bottom row. Row and column distances follow this grid — adjacency is Manhattan distance exactly one, never a diagonal.

Select an exhibit in the roster or click a bay. With an exhibit selected, choosing another bay swaps the two occupants.

Route Select an exhibit to plot its preferred-bay route.
Manual layout is legal Hard checks pass and all enabled soft rules hold.
Route cost Σ w × d 4

02 · Distance ledger

Contribution by exhibit

Recomputed on every move

Each contribution is weight × Manhattan distance from the exhibit's current bay to its preferred bay. The total is shown even when the floor is illegal; legality is judged separately.

Distance and route cost contribution for every exhibit in the current manual layout
Exhibit Bay Pref. d W Cost
Total route cost 4

03 · Manual placement

Exhibit roster

Total cost4

Select an exhibit to plot its route. Then choose any bay — the occupants swap, and the solver result clears until you solve again.

Keyboard move

Tip: with an exhibit selected, each bay button swaps it directly. Arrow keys move focus between bays.

04 · Rule monitor

Soft rules & hard checks

6 of 6 enabled

Soft rules are individually toggleable and are checked against the manual floor. Capacity, one exhibit per bay and pins are hard rules and never toggleable.

    Hard checks

      05 · Accepted configuration

      Weights, bays & pins

      Weights and capacities accept integers 1–4; preferred bays accept 1–6. Only valid entries are accepted — an invalid entry leaves the last accepted configuration untouched.

      Bay capacities

      Pins are hard rules. A pin that conflicts with another pin or a capacity is reported by the solver as hard infeasible, never silently dropped.

      06 · Exact solver

      Every assignment, checked

      720 candidates

      The solver enumerates all 720 permutations of A–F under the accepted configuration. It minimises Σ weight × distance, then breaks ties on the lexicographically smallest bay string (A<B<C<D<E<F).

      07 · JSON export

      Current state

      Selectable · live

      Accepted configuration, manual occupancy, violations, cost contributions and the current solver result (or null) — all generated from the same state as the board.

      Press Ctrl/Cmd + C after selecting.