Fewest votes in worst defeat tie breaker

[DEMOREP1 at aol.com]

Another tie breaker for the repeated elimination of candidates is as follows:

Assume 3 or more candidates are in a head to head circular tie.
(a) Drop all candidates defeated by each other candidate.
(b) Drop the candidate who gets the fewest votes in any of his/her
combinations (i.e. his/her worst defeat) with the candidates in the tie. 
(c) Look at the combinations to see if there is a winner (or are the winners,
if 2 or more are to be elected) among the remaining candidates.
(d) If there are no winner(s), then drop the next candidate who gets the
fewest votes in any of his/her combinations (i.e. his/her worst defeat) with
the remaining candidates in the tie.
(e) Repeat (b), (c) and (d) until there is only the winner (or winners)
remaining.

The above comes from what happens in counting in combinations. 
One executive or judicial officer to be elected
TW= Test Winner, TL= Test Loser, TO= Test Others
TW     TL        TO
X         Y         P, Q, R

Each top choice vote for each of P, Q or R gets counted for X or Y whichever
comes first on the voter's ballot. 
Example-- A voter votes RPYX
Y gets a vote from such voter.  (This is the plain Condorcet head to head
pairing).

All of the possible combinations are done.
One of the Test Winners or Test Losers will get the fewest number of votes in
all of the possible combinations.

There is no guarantee that the final winner gets a majority vote of all of
the voters due to truncated votes.
------
2 or more executive or judicial candidates to be elected---  Example- elect 3
judges at large
TW           TL          TO
K, L, M       P           F, J, D

The top 3 choices of each of the voters who voted for F, J or D get counted
for K, L, M or P whichever appears first on the voter's ballot.  
Example- a voter votes FLJPKM
L, P and K each get a vote from such voter.

All of the possible combinations are done.
One of the Test Winners or Test Losers will get the fewest number of votes in
all of the possible combinations.

There is no guarantee that the final winners each gets a majority vote of all
of the voters due to truncated votes.
------- 
Legislative elections- 2 or more candidates to be elected.
TW           TL          TO
S, T, U       W          C, H, N

The top choice of each of the voters who voted for C, H or N  get counted for
S, T, U or W whichever appears first on the voter's ballot.   
Example- A voter votes NCTWS
T gets a vote from such voter.

All of the possible combinations are done.
One of the Test Winners or Test Losers will get the fewest number of votes in
all of the possible combinations.

Each of the 2 or more final winners would have a voting power in the
legislative body equal to the number of votes each finally receives in the
election. 
---
No ties are assumed for the candidate losing in any example.
In all cases, the fewest votes that a candidate can get is, of course, the
number of first choice votes that he/she gets.

For clarity on paper, the computer might reorder the votes when a candidate
loses.  
Example-- A voter votes ZCBEC. Assume E loses. The next round might show such
vote to then become ZCBC.