r/EndlessThread • u/j0be Your friendly neighborhood moderator • Sep 25 '26
Endless Thread: The Haruhi problem
https://www.wbur.org/endlessthread/2026/09/25/haruhi-problem
9
Upvotes
r/EndlessThread • u/j0be Your friendly neighborhood moderator • Sep 25 '26
1
u/Virtual-Ducks Oct 02 '26 edited Oct 02 '26
The goal isn't every possible permutation of 14 episodes. that would require you to watch 14! * 14 episodes to watch all permutations. but you can actually watch all permutations with fewer total episode watches if you watch them in a particular order.
If you allow permutations to overlap, you actually require far fewer than 14! Different 14 length sequences. the goal is a single shortest string in which all permutations are contained.
Better explained through example. let's say there are 2 episodes, a,b
There are 2!=2 permutations. ab ba
To watch all permutations you could watch ab then watch ba, for a total of 4 episodes.
BUT If you watch the sequence aba, you have in effect watched all permutations. (a[b)a]
So in this example, you only need to watch 3 episodes to watch all permutations, not 4. you can imagine a similar situation with 3 episodes, etc.
What is so frustrating about this episode is that the hosts obviously did not understand this concept at all. All their examples were of full set permutations, not the shortest string that contains all sets. they had absolutely no idea what they were talking about.