Gathering Seating Constraints

What it helps with

Find a feasible guest-to-seat assignment from explicit allowed seats, fixed places and pair constraints; distinguish search limits from infeasibility.

Say it like this

Seat these guests using my fixed seats and explicit avoid-adjacency rules.

Tell me whether the table constraints are infeasible or the search only hit its limit.

What you receive

Get the exact seat/table IDs and adjacency edges. Turn only the family's explicit requirements into hard constraints. Check whether the result is feasible, infeasible after exhaustive search, or unknown after the node limit; never describe a capped search as impossible. Return the seat rows and any missing decisions without inferring relationships.

Give the assistant your existing records, explicit directory or measured dimensions. It asks for facts that materially affect the result; fictional examples never fill missing real records. Results stay in your assistant workspace for review and download, preserving source material.

The Skill is free with no extra paid API key. Optional AI interpretation uses your configured model and ordinary separate charges. The local tool requires Python3.10+.

Primary references

• Official source 1 ↗