[Zoughtbaj]

Dear CD,

Our scouting team is currently working on a way to rank the minibot race. The current way that I figured out so far is to input win data into a matrix and square it, but we are wondering if there is a more effective way to do this, or if it is what we should use. I tried looking up other scouting methods and all I found was OPR, which doesn't fit what we are trying to find in this case.

As for how specifically we are using the matrix, we are taking how the minibot ranks in a match and translating it into wins. For example, lets say there are Minibots A, B, C, and D. If the rank 1, 2, 3, and 4 respectively, then A will have a "win" against B, C, and D, B will have a "win" against C and D, C will have a win against D, and D will have no data. essentially, it will look like:

O A B C D
A 0 1 1 1
B 0 0 1 1
C 0 0 0 1
D 0 0 0 0

And to clarify, if the same thing happens, it would look like:

O A B C D
A 0 2 2 2
B 0 0 2 2
C 0 0 0 2
D 0 0 0 0


We would then square that matrix, sum the rows, and whoever has the highest sum has the highest rank. I'll include the excel sheet we are using so far. In theory, it will end up being a 50x50 matrix or however many teams there are at competition, but for experimentation purposes we are working with a 8x8 matrix.