this post was submitted on 16 Jan 2024
245 points (97.7% liked)

xkcd

8694 readers
45 users here now

A community for a webcomic of romance, sarcasm, math, and language.

founded 1 year ago
MODERATORS
 

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:

you are viewing a single comment's thread
view the rest of the comments
[–] Oka@lemmy.ml 7 points 9 months ago

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.