The goal is to determine a ranked list of winners of an election using the Hunt-Le-Roux algorithm (which is a variation of the Single Transferable Vote algorithm.)
This is achieved by providing as input:
Enter the number of candidates to be ranked on ballot:
Number of candidates to be ranked on ballot: 9
Enter the names of the candidates, in the sequence they appear on the ballot paper, one candidate per line.
Prepare the CSV file, e.g. with the following content:
2, 9, 1, 5, 8, 4, 6, 7, 3
3, 7, 5, 2, 1, 4, 6, 9
5, 2, 6, 4, 9, 7, 1, 3, 8
8, 1, 7, 3, 9, 4, 2, 5, 6
9, 3, 5, 7, 2, 1, 4, 6, 8
8, 5, 2, 3, 6, 4, 1, 7, 9
8, 2, 5, 3, 4, 7, 9, 1, 6
2, 5, 8, 9, 6, 4, 1, 3, 7
8, 5, 7, 2, 1, 6, 9, 3, 4
2, 8, 5, 1, 6, 7, 9, 4, 3
Each number refers to the n-th candidate specified in "Candidates" above.
Select this file as "Ballot file".
Hit the "Submit" button. A file will be downloaded with two files:
winners.txt contains the candidate's names in the sequence
they are elected in, i.e. the first winner is in the first line, the second in
the second line, etc.election.log contains the detailed steps the algorithm took to determine the winners.