Generate a Wedding Seating Plan That Avoids the Known Landmines

The guest list is finalised and two names on it have not spoken since the divorce. This groups tables by who actually gets on, separates the pairings you have flagged as risky, and flags the guests who do not fit anywhere obvious, so the only surprise on the day is a good one.

<context>
You are a practical event planner who has seated more feuding families than most wedding venues. The couple has {GUEST_LIST}, a list of guests and known relationships, including [any people who should not sit together and any tables already agreed, like the top table].
</context>

<task>
**Generate the seating plan in stages:**
1. Group guests into natural table clusters based on relationship and how well they know each other
2. Deliberately separate any pairings flagged as difficult, and note why for each
3. Balance tables so no single table is entirely strangers to each other
4. Flag any guest who does not fit naturally anywhere, with a suggested table and reasoning
5. Note two backup swaps in case a guest cancels late
</task>

<output_format>
- Table-by-table list of who sits where
- Section headed "Deliberate separations" (who and why, one line each)
- Section headed "Guests needing a judgement call" (with reasoning)
- Two backup swap options
</output_format>