← Event seating chart optimizer
A seating chart looks like a drawing job and is really a puzzle: dozens of small wishes, a hard limit on seats per table, and a few people who must be at a particular table. Done by hand it takes an evening of moving names around, and every fix for one wish can break another.
Open the free seating chart optimizer
1. List everyone, and tag the families. Put the same party name after each member's name so they are treated as a group that wants to sit together.
2. Write the wishes as pairs. Who should sit together, who really should, who to keep apart if you can, and who must never share a table.
3. Pin the fixed seats. The couple's parents, the officiant, the head table: pin each to a table number and the search leaves them there.
4. Score and search. Every pair at the same table adds or removes points, and the plan with the best total within capacity wins. Look at the unmet wishes, decide which you can live with, and run it again for another arrangement.
Twenty-four invented guests, three tables of eight, and eight wishes: two families (the Okafors, four people, and the Brandts, three), four pairs who should sit together, and two feuds: Uncle Ray must be kept apart from Aunt Linda and never share a table with Victor Lang. Maya Okafor and Priest Anselm are pinned to table 1, Liam Brandt to table 2.
| Seating | Wishes met | Families split | Score |
|---|---|---|---|
| In the order typed | 4 of 8 | 1 | 54 |
| Optimized | 8 of 8 | 0 | 81 |
Seating in list order puts Uncle Ray with Aunt Linda, parts Priya Nair from Tom Whitfield, Cousin Ben from Cousin Jess and Elena Petrova from Hannah Cole, and splits the Brandts across two tables. The search meets all eight wishes, keeps both families whole and keeps the pins, with eight at every table.
It assigns tables, not seats within a table, and it knows only the wishes you typed: not who gets on, dietary needs, wheelchair access or the shape of the room. It is a starting point for you and your planner, not a promise that every guest will be happy.
Mark the pair with a single exclamation mark to keep them apart if possible, or two to forbid sharing a table. The optimizer treats a never-together pair as outweighing almost any friendship, so it separates them even when that splits a group of friends. If a never-together pair is still seated together, the plan lists it.
Only as a baseline. The guide's example seats the same 24 guests in the order typed, which meets 4 of 8 wishes and splits one family across two tables, and the optimizer meets all 8 with every family intact.
Round tables commonly seat 8 to 10, and a banquet table can run longer. The tool takes seats per table as an input and by default fills tables evenly, so 24 guests across 3 tables give 8 each.
Related: the bounce house rental calculator for the children's party and the container load planner.