Adapted from Rob Lanphier's Condorcet Method Program page. Here is the program's source code.
If one candidate wins all the pairwise comparison tests, that candidate is the Condorcet winner. If there is no Condorcet winner, then some kind of tie-breaker may be necessary. The Condorcet tie-breaker method looks at each candidate's worst defeat and finds the one with the fewest votes against. The Copeland tie-breaker method looks at each candidate's win-loss-tie record and evaluates W+0.5T. Another tie-breaker method is to evaluate +W-L+0.5T.
In large-scale elections, you can collate ballots that match each other. If you wish to specify multiple ballots with the same ranking, precede the ranked list with a number and a colon to indicate the number of identical ballots with that ranking.
COLLATED BALLOTS 40:3>2 # 40 ballots where C is preferred over B (and both implicitly over A and D) 9:2>3 # 9 ballots where B is preferred over C 15:1>2 # 15 ballots where A is preferred over B 16:2>1 # 16 ballots where B is preferred over A 20:1=2 # 20 ballots show no preference concerning A and B
You may put comments after a hash symbol (#). Any text after # on a line will be ignored.