Talk:173: Movie Seating

explain xkcd: It's 'cause you're dumb.
Latest comment: 29 September by FaviFake
Jump to navigation Jump to search

I think that "two friends ... each sitting three seats away" takes "they" a little too literally. Daddy (talk) 06:17, 28 April 2013 (UTC)Reply

Look at it like this. Placing them _friends_ apart guarantees lower background noise so you can actually watch the movie. 108.162.231.227 (talk) 05:46, 28 November 2013 (UTC) (please sign your comments with ~~~~)Reply

Truthfully, I feel one-way crush should be second priority 05:09, 14 November 2015 (UTC) Lonely... 162.158.102.148 (talk) 05:09, 14 November 2015 (UTC) (please sign your comments with ~~~~)Reply

I know I'm horrifically late on this one, but surely swapping 4 and 7 is the solution which minimizes strangers in "Do not keep 8 away from 6". There is currently no path from 8 to 4. Swapping 4 and 7 downgrades the link to 5 to an Acquaintance from Friendship, but offers a viable path between all members. Unless we're intentionally forcing 8 to talk to 6? 162.158.99.64 08:20, 15 December 2015 (UTC)Reply

The solutions are making assumptions about the weighting of friends, relationships, and acquaintances. For example, maybe someone in a relationship would achieve maximum enjoyment if the SO is seated next to a stranger so all focus is on them. -- Flewk (talk) 15:42, 25 December 2015 (UTC) (please sign your comments with ~~~~)Reply

If we take the "keep 8 away" solution and put 8 in middle of 6 and 3, wouldn't the result be strictly superior to the "do not keep 8 away" one? It'd have the same number of adjacent relationships, but 6 would be seated next to a friend instead of an aquaintance, which is better. 141.101.104.82 16:38, 23 May 2016 (UTC)Reply

8 doesn't know 1 or 5, so "keep 8 away" solution is bad. He would be alone then. 162.158.238.58 15:44, 24 December 2016 (UTC)Reply

Maybe it's best to separate the couples so that no one has to be the third wheel. I propose [1,3,4,5,7,8,6,2]. Now, it might be unfair to #1, since his only connection is his girlfriend, so [3,4,5,7,8,6,2,1] works as well. 198.41.226.124 19:52, 15 August 2017 (UTC)Reply

Bit of a naive solution, here. But if we assume the acquaintance is the weakest/least important of the relationships, we can just flatten the graph as if they were not there. So 8,6,1,2,3,4,7,5 (or 8,6,2,1,3,4,7,5 depending on who 1 would like to sit with more: 3 or 6) 172.68.34.172 20:11, 4 January 2020 (UTC)Reply

surely if you are trying to maximise enjoyment, and asuming a one way crush is equivalent to either a friend or an acquaintance for number 6, and a relationship for number 8, a more realistic option is [1,2,6,8,3,4,7,5] 172.68.210.47 07:01, 12 July 2022 (UTC)Reply

In most movie theaters here in Atlanta, seats are indeed reserved. To deal with the declining profit margins and way that seating for anything but new blockbusters tends to be half empty, the theaters have replaced the small, uncomfortable festival seating with a small number of assigned recliners. I kid you not. It makes the high ticket prices seem more worthwhile. — Kazvorpal (talk) 04:16, 6 October 2019 (UTC)Reply

I wrote a program to find the best option through brute force (ignoring the one-way crush). It's [8,5,7,4,3,6,2,1] -- Squidy9002 (talk) 19:46, 21 March 2025 (UTC) (please sign your comments with ~~~~)Reply

Thx, i added it to the explanation --FaviFake (talk) 09:16, 22 March 2025 (UTC)Reply

I'm a bit surprised than no one has brought up the idea to not file into a single row as a large group, but into two or three consecutive rows, thus sitting in a nxm-Matrix where n,m>1. This certainly eases the social problem at stake, and brings many solutions fairly close to each other in terms of enjoyment score. It might make the computational problem harder, aka more interesting, though. 92.209.6.41 11:18, 29 September 2026 (UTC)Reply

Great point! I added that to the explanation, feel free to edit it further!! FaviFake (talk) 14:13, 29 September 2026 (UTC)Reply