by ohthatpatrick Tue Jul 18, 2017 2:58 pm
For Relative Ordering (i.e. Ordering games where all the rules are simple relative relationships, and all the characters' rules end up linking together), you don't need to mark up exclusions underneath the number line.
We just use that Tree diagram to figure out what's possible. Unfortunately, the tree is really hard to type in this ASCII environment
N..........G
....\..........\
P - H - O - L
..../
.K - I
With this Tree we can answer pretty much any question, so we don't linger at the setup stage to try to make deductions / inferences.
There's only one question I ask myself on Relative Ordering games:
1. Who could go first? Who could go last?
In this game, N, P, K, and G could all be 1st. That's not interesting.
Only L or I could be last. That's worth putting in our master diagram.
__ __ __ __ __ __ __ L/I
When we do Q4, we get the payoff:
If L is 7, then we know I is 8th, so the correct answer is (B).
If you put I in spot 2, you won't be able to find anyone to put in spot 8.
Hope this helps