On Jun 7, 1:23=A0am, ThoML <micat... / gmail.com> wrote:
> > What determines the best pairing? A score will be calculated for your ou=
tput
> > against the input. For each player, the partner is found in the player's=

> > ordered list, as an index. So, for the above example:
>
> > =A0 =A0 David: 0
> > =A0 =A0 Helen: 0
> > =A0 =A0 Joseph: 0
> > =A0 =A0 Vicki: 2
>
> What is the penalty for "unwanted" pairings, e.g.
>
> =A0 =A0 David: Helen Vicki
> =A0 =A0 Helen: David
> =A0 =A0 Joseph: Vicki Helen
> =A0 =A0 Vicki: David
>
> with output:
>
> =A0 =A0 David Joseph
> =A0 =A0 Helen Vicki
>
> Or is the list of preferences always complete, i.e. it always contains
> all other players?

Yes, always complete, the least preferred players will be toward the
end.