|Perl: the Markov chain saw|
Re^2: Possible pairings for first knockout round of UEFA champions leagueby LanX (Canon)
|on Dec 22, 2012 at 15:36 UTC||Need Help??|
It's a branch and bound-algorithm, by early cutting unnecessary branches I avoid calculating all permutations, which is (far╣) more efficient.▓
And it gave me the opportunity to check some mathematical approaches (which are more challenging for me)
But you're welcome to show us your way to do it!(BTW: I saw your approach already been done in Python, if you're interested)
╣) since 8! is only ~40000 it's not too obvious in this special case.
▓) Furthermore branching allows to cache/memoize results for subtrees to go even faster.