173: Movie Seating - Revision history

194.12.152.210: /* Solutions */

2025-09-26T14:52:18Z

‎Solutions

FaviFake: /* Solutions */

2025-03-22T09:16:16Z

‎Solutions

FaviFake: User:Squidy9002 wrote a program to find the best option through brute force, ignoring the one-way crush. According to their program, the best order is: 8, 5, 7, 4, 3, 6, 2, 1.

2025-03-22T09:16:02Z

User:Squidy9002 wrote a program to find the best option through brute force, ignoring the one-way crush. According to their program, the best order is: 8, 5, 7, 4, 3, 6, 2, 1.

42.book.addict at 22:28, 23 October 2024

2024-10-23T22:28:23Z

42.book.addict: /* Solutions */

2024-10-23T22:26:55Z

‎Solutions

FaviFake: Added link to xkcd: volume 0

2023-07-25T09:55:26Z

Added link to xkcd: volume 0

Jacky720: Reverted edits by Xray Kilo Charlie Delta (talk) to last revision by Theusaf

2022-05-23T18:47:14Z

Reverted edits by Xray Kilo Charlie Delta (talk) to last revision by Theusaf

Show changes

Xray Kilo Charlie Delta: haha your js cant stop my js

2022-05-23T18:13:21Z

haha your js cant stop my js

Show changes

Theusaf: Reverted edits by 👖🔥 (talk) to last revision by Jacky720

2022-05-11T18:47:00Z

Reverted edits by 👖🔥 (talk) to last revision by Jacky720

Show changes

👖🔥 at 17:31, 11 May 2022

2022-05-11T17:31:05Z

Show changes

@@ Line 15: / Line 15: @@
 ===Solutions===
-[[User:Squidy9002]] wrote a program to find the best option through brute force, ignoring the one-way crush. According to their program, the best order is: '''8, 5, 7, 4, 3, 6, 2, 1'''.
+Solutions depend on how the "optimal seating" is defined: giving each connection type a "weight" and finding the highest possible sum value of achieved pairings, avoiding to have a "lonely" person without connections, or other goals are possible
 Two other hypothetical solutions for the specific problem proposed in the comic are here:
 [[File:173_Solutions.jpg|1000px]]
 ==Transcript==

@@ Line 15: / Line 15: @@
 ===Solutions===
-[[User:Squidy9002]] wrote a program to find the best option through brute force, ignoring the one-way crush. According to their program, the best order is: 8, 5, 7, 4, 3, 6, 2, 1.
+[[User:Squidy9002]] wrote a program to find the best option through brute force, ignoring the one-way crush. According to their program, the best order is: '''8, 5, 7, 4, 3, 6, 2, 1'''.
 Two other hypothetical solutions for the specific problem proposed in the comic are here:

@@ Line 8: / Line 8: @@
 ==Explanation==
-At the time of writing in most movie theaters in the US, {{w|Movie theater#Pricing and admission|seats were not reserved}}.<ref>In the years after this comic was published, some theaters around the U.S. began to sell movie tickets with reserved seats, both online and when purchased at the theater.  When you buy your ticket, you also specify which seat you would like to sit in.  Therefore, if you buy multiple tickets, you can select seats that are adjacent to each other, provided that you purchase them early enough before the point when you cannot find two or more empty seats together any longer.</ref> That is, tickets are sold by screening without seat assignment, and therefore 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.
+At the time of writing in most movie theaters in the US, {{w|Movie theater#Pricing and admission|seats were not reserved}}. That is, tickets were sold by screening without seat assignment, so 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. After this comic was published, some theaters around the U.S. began to sell movie tickets with reserved seats, both online and when purchased at the theater. When you buy your ticket, you also specify which seat you would like to sit in. Therefore, if you buy multiple tickets, you can select seats that are adjacent to each other.
 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|Traveling salesman problem|traveling salesman problem}}, is referenced in the title text, as well as in comics [[287]] and [[399]].
@@ Line 14: / Line 14: @@
 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.
-==References==
+===Solutions===
-{{reflist}}
+[[User:Squidy9002]] wrote a program to find the best option through brute force, ignoring the one-way crush. According to their program, the best order is: 8, 5, 7, 4, 3, 6, 2, 1.
-==Solutions==
+Two other hypothetical solutions for the specific problem proposed in the comic are here:
-[[File:173_Solutions.jpg|750px]]
+[[File:173_Solutions.jpg|1000px]]
 ==Transcript==

@@ Line 14: / Line 14: @@
 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.
-<references />
+==References==
 ==Solutions==
@@ Line 33: / Line 34: @@
 ==Trivia==
-In ''[[xkcd: volume 0]]'', Randall says that this was his "passive-aggressive way of asking my friends to let me plan seating.".
+In ''[[xkcd: volume 0]]'', Randall says that this was his "passive-aggressive way of asking my friends to let me plan seating."
 {{comic discussion}}

@@ Line 19: / Line 19: @@
 Two hypothetical solutions for the specific problem proposed in the comic are displayed:
-[[File:173_Solutions.jpg]]
+[[File:173_Solutions.jpg|750px]]
 ==Transcript==

@@ Line 33: / Line 33: @@
 ==Trivia==
-*Randall states in xkcd: volume 0 that this was his "passive-aggressive way of asking my friends to let me plan seating."
+In ''[[xkcd: volume 0]]'', Randall says that this was his "passive-aggressive way of asking my friends to let me plan seating.".
 {{comic discussion}}
 [[Category:Comics featuring Cueball]]
 [[Category:Comics featuring Megan]]