240
xkcd #173: Movie Seating (20 Oct 2006)
(programming.dev)
cross-posted from: https://programming.dev/post/8619086
Title text:
It's like the traveling salesman problem, but the endpoints are different and you can't ask your friends for help because they're sitting three seats down.
Links:
Optimal seating for this group would probable be this graph left to right, except for one-way crush person, they go on the very right.
First couple > bottom friend > top friend > second couple > top right friend > 1-way crusher
Friends are within 1 seat of each other.