Wedding Table Optimiser

This demo shows how constraint optimisation works. Variables are guest positions, constraints are seating rules, and the objective function is total conflict.

This number shows how many ways there are to seat guests - you cannot check them all manually.

AI improves the score by performing swaps that lower conflict. Time budgets show how more search often reduces conflict but costs time.

This demo maps the same optimisation ideas used in group-breeding design research (constraint programming) into a simple seating problem to explore trade-offs and scalability.

Controls

Guests (6-16) 10 Tables (2-4) 3 Max table size 4 Minimum seated guests 8 Enforce max pair conflict Pair conflict threshold 7 Seed (deterministic mode) AI time budget

Upper-bound search space (tables^guests): calculating...

Your score

Random baseline

AI score

Improvement: -

Manual Attempt

Drag guests between seats, or use keyboard: Enter/Space to pick up/place, Arrow keys to switch target table.

AI Improved

This board is independent from manual edits and uses recorded swap playback.

AI Playback

Speed

Guest Conflict Network

Edges are thicker for higher conflict. Click a node to highlight that guest.

AI Insight Panel

Advanced view: pairwise conflict matrix

Statement-of-Work note: :contentReference[oaicite:0]{index=0}