Computers are able to calculate superpermutations for n = 4 and n = 5 but not for anything beyond that.
Since the series in question has 14 episodes, it would take 93,884,313,611 episodes to see all possible combinations. Or roughly 4 million years of non-stop viewing.
Some interesting bits from the article:
Anon is credited as the first author in the paper
Since the series in question has 14 episodes, it would take 93,884,313,611 episodes to see all possible combinations. Or roughly 4 million years of non-stop viewing.
Is this number the exact result or a lower bound ?