i have a question about the last game in the Dec 06' games section.
how do you guys approach setting up this problem?
i cant really find a good way to organize it efficiently. Thanks
i tried both ordering rules set-up [numbering 1-8 and saying which letter cant go in what box, ect..] and then a chain [b/c not one letter has a specific spot it has to be in] but neither seemed to work well.
This obviously doesn't look like my hand-drawn diagram, but you have to redraw it so that the 'greater than' sign to the left of the M covers the H, N, and J, while the sign to the left of the L applies only to the H. The extended arrow to the right of the L indicates that L could be anywhere but first.
the O is to the right of the G and the K equally, and the extended arrow to the left of the K indicates that K can be anywhere but last.
H>L- - - - ->
N > M > G > O
If you know how to read this diagram accurately, you don't need any others.
Don't set up slots 1 thru 8 until and unless they tell you something specific about who goes in which particular slot (q.'s 18, 19, 21).