August 2019 - Solution

<< July September >>

August 2019 Challenge

The restrictions A>F, A>G, A>H, B>E, B>G, B>H, C>E, C>F, C>H, D>E, D>F, and D>G leave the four pairs A<E, B<F, C<G, and D<H as possible.
However, it is easy to show that no two of them can be in the same permutation.
For example, if A<E, then F<A<E<B yields that B<F cannot hold.
Therefore, you need at least four permutations to cover all undetermined pairs.