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:

22 points

Good thing I don’t know enough people for me to ever go to the movies in that big a group.

permalink
report
reply
15 points

the problem here is technically not you knowing people but that the people you know can also know people that you don’t know, expanding the graph beyond the first layer that you personally observe.

tl;dr: don’t allow recursive invites

permalink
report
parent
reply
17 points

You also need to account for where the really tall people are in the row in front of you. Social optimization be damned, I want to see!

permalink
report
reply
5 points

And group people based on how loud their snacks are.

Also, am I the only one hating that person who keeps talking how the seating is suboptimal while everyone else tries to watch the movie?

permalink
report
parent
reply
2 points

Those ones you group outside the movie theater.

permalink
report
parent
reply
5 points

Yeah, well we want to have enough space to sit lower, but it’s not always an option unfortunately! :-)

permalink
report
parent
reply
7 points

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.

permalink
report
reply
1 point
*

The group in this comic is bizarrely low connectivity for what is supposedly a friendship group. Not a single 3-cycle of actual friends among them?

permalink
report
reply

xkcd

!xkcd@lemmy.world

Create post

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

Community stats

  • 1.6K

    Monthly active users

  • 258

    Posts

  • 5.6K

    Comments

Community moderators