Hi Kristin,
This is definitely a difficult game with some complex inferences.
1) You are right about the first part of this. The rule means that you cannot have the same pairs repeat. So if Rita dances with Karl in dance one, then she cannot dance with him in dance two or three. As for how we know that each child only dances once per dance, the scenario tells us that there are 3 dances and "each dance involves three pairs of children, a boy and a girl partnering each other in each pair". There is no indication that a child can switch partners in the middle of dance. So during dance 1, there will be three pairs dancing at the same time so they have to be 6 different people. There is no linear element within Dance 1; it is not as if one pair will dance, then another pair, and then the third pair.
2) Those inferences come from a combination of all three rules. The second rule states that the same person who dances with R in dance 2 dances with S in dance 3. Since pairs cannot repeat, the third rule, that means that the person who is with R in 2 and S in 3 must be with T in 1. We also know that this person is not K because the first rule tells us K is with S in one or 2, not dance 3. That is the easiest of those inferences. Then look at the first rule: K partners S in either dance 1 or dance 2.
If K is with S in dance 1 several things must happen. In dance two K cannot be with S again and we know that it cannot be paired with R, because again the same person paired with R in two must be paired with S in three and K cannot be with S in three since we are pairing it with S in 1. So K has to be with T in dance 2. Then in dance three K must be with R because that's the only girl he hasn't paired with. So K will be with S in 1, T in 2, and R in three. From the first inference above one person is with T in 1, R in 2, and S in 3. So the only spots left for the third boy are with R in 1, S in 2, and T in 3. The same pattern emerges if you place K with S in dance 2. One boy must partner with T in dance 1, R in dance 2, and S in dance 3. One boy must partner with R in dance 1, S in dance 2, and T in dance 3. One boy must partner with S in dance 1, T in dance 2, and R in dance 3. The easiest way to see these may be to draw out hypotheticals.
When writing out the hypothetical to see the pattern, start with K with S in 1 or 2 and then just pick either L or M as the person with R in 2 and S in 3 instead of writing them as dual options. So writing out K with S in 1 and picking L as the person in the second rule who is with R in 2 and S in 3 would start like this:
R
__
L
__
S
K
__
L
T
__
__
__
Since L is paired with R in 2 and S in 3 then it has to be with T in 1 so there are no repeats (that first inference)
R
__
L
__
S
K
__
L
T
L
__
__
In dance 2, K cannot be with S again so it has to be with T. In dance 3 K must be with R since it has been with S and T.
R
__
L
K
S
K
__
L
T
L
K
__
The only spots left for M are R in 1, S in 2, and T in 3
R
M
L
K
S
K
M
L
T
L
K
M
Again, placing K with S in 2 gives the same pattern. I hope this helps you understand where the inferences come from.
Ladan