Because we don't know ahead of time the actual ranking we just have them listed randomly:
Now a matchup grid is made.Every team plays 5 other teams. It actually took a little while to think of a pattern that had 5 x's in each row, each column, where if there was an x in a row, column pair then it was also in the transpose, and that nothing was on the top left to bottom right diagonal which would mean a team was playing itself.
Using the fact that earlier letters in the alphabet beat later ones a 1 is put for every win of a row versus a column.
So after 10 iterations of putting the sum of a rows entries into the non-zero column entries it gives the ranking of:
So it recovered most of the original alphabetical order.