Re^4: Possible pairings for first knockout round of UEFA champions league

[LanX]

The algorithm constructs recursively possible combinations of runner-ups meeting an ordered set of group winners:

Paris Schalke Malaga Dortmund Turin  Bayern   Barcelona  ManU

now if you take a look at this excerpt of the results and you will notice that the last 4 branches are repeating.

                            |
...                         |
Arsenal Porto Donezk Mailand Madrid Celtic Galatasaray Valencia
Arsenal Porto Donezk Mailand Valencia Madrid Galatasaray Celtic
Arsenal Porto Donezk Mailand Valencia Celtic Galatasaray Madrid
Arsenal Porto Donezk Mailand Celtic Madrid Galatasaray Valencia
...                         |
Arsenal Mailand Porto Donezk Madrid Celtic Galatasaray Valencia
Arsenal Mailand Porto Donezk Valencia Madrid Galatasaray Celtic
Arsenal Mailand Porto Donezk Valencia Celtic Galatasaray Madrid
Arsenal Mailand Porto Donezk Celtic Madrid Galatasaray Valencia
...                         |
                            |

Which is obviously right since the first 4 are only permutations of the same set.

So the following pairings (Turin  Bayern   Barcelona  ManU) x (Madrid Celtic Galatasaray Valencia) are always the same.

Now storing the result for a normalized representation of a already calculated set,

(something like join "-",sort(@drawn) as a hash key)

helps reusing the once calculated subresult after encountering any permutation of (Arsenal Mailand Porto Donezk)

It depends on the ratio between memory and time complexity but this normally gives an enormous boost to such search algorithms.