Editing 173: Movie Seating
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 8: | Line 8: | ||
==Explanation== | ==Explanation== | ||
− | + | In movie theaters in the US, {{w|Movie_theater#Pricing_and_admission|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 {{w|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 {{w|mathematics}}, this type of problem is called {{w|combinatorial optimisation}}. The most popular example, the {{w| | + | 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 {{w|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 {{w|mathematics}}, this type of problem is called {{w|combinatorial optimisation}}. The most popular example, the "{{w|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 | + | 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. |
− | |||
− | |||
==Solutions== | ==Solutions== | ||
Two hypothetical solutions for the specific problem proposed in the comic are displayed: | Two hypothetical solutions for the specific problem proposed in the comic are displayed: | ||
− | |||
[[File:173_Solutions.jpg]] | [[File:173_Solutions.jpg]] | ||
Line 29: | Line 26: | ||
::Arrow: one-way crush. | ::Arrow: one-way crush. | ||
::Dashed line: acquaintances | ::Dashed line: acquaintances | ||
− | :[The eight friends | + | :[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! | :Cueball: Guys! This is not socially optimal! | ||
− | |||
− | |||
− | |||
{{comic discussion}} | {{comic discussion}} | ||
− | |||
[[Category:Comics featuring Cueball]] | [[Category:Comics featuring Cueball]] | ||
[[Category:Comics featuring Megan]] | [[Category:Comics featuring Megan]] | ||
[[Category:Comics featuring Hairy]] | [[Category:Comics featuring Hairy]] | ||
[[Category:Math]] | [[Category:Math]] | ||
− | |||
− | |||
− |