10 candidate tie example more

[DEMOREP1 at aol.com]

Below is the array (matrix) of the A-J example.
If the candidate in the top row beats (loses to) the candidate at the left
(first column), there is a W (L) in the cell. For each W, there is the
corresponding L. T= tie. X= diagonal

X A B C D E F G H I J
A X L L T T T T T T T
B W X L W T T T T T T
C W W X L T T T T T T
D T L W X T T T T T T
E T T T T X L T T T T
F T T T T W X L T T T
G T T T T T W X L T T
H T T T T T T W X T T
I T T T T T T T T X L
J T T T T T T T T W X

The general case is that a candidate survives if he/she does not lose to
every other candidate.