173: Movie Seating
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.
In movie theaters in the US, seats are not reserved. That is, tickets are sold for a screening, do not designate seats, and therefore let an entering patron can take any vacant seat. Therefore a group of incoming patrons may walk in a column and take a section of consecutive seats in a row, each person taking one next to the person in front of them. The order of these people is thus determined by the order in which they walk into the theater, which is in most cases random.
Cueball is upset at the way he and his friends have sat down at the movie theater. Part of the problem is that two people who are apparently in a relationship do not sit together. He therefore tries to use a social graph to calculate the best way for him and his seven friends to sit in a row, while taking into account all of the social connections among them. In mathematics, this type of problem is called combinatorial optimisation. The most popular example, the travelling salesman problem, is referenced in the title text, as well as in comics 287 and 399.
The title text shows that another part of the problem is that Cueball's friends who could have helped him calculate a solution are each sitting three seats away from him, and so he cannot ask them for help.
- At the movies, I get frustrated when we file into our row haphazardly, ignoring the computationally difficulty problem of seating people together for maximum enjoyment.
- [Map of relationships between 8 people.]
- Single line: friends.
- Double line: in a relationship.
- Arrow: one-way crush.
- Dashed line: acquaintances
- [The eight friends sitting in a row in a dark cinema. Cueball and one other are between two lovers.]
- Cueball: Guys! This is not socially optimal!