#24 Ohio State (8-4)

avg: 1926.9  •  sd: 122.69  •  top 16/20: 20.8%

Click on a column to sort  • 
# Opponent Result Game Rating Status Date Event
69 James Madison Win 12-3 1981 Jan 25th Winta Binta Vinta 2025
82 Penn State** Win 12-1 1840.15 Ignored Jan 25th Winta Binta Vinta 2025
205 Virginia-B** Win 13-0 600 Ignored Jan 25th Winta Binta Vinta 2025
69 James Madison Win 13-1 1981 Jan 26th Winta Binta Vinta 2025
114 North Carolina-Wilmington** Win 13-0 1586.66 Ignored Jan 26th Winta Binta Vinta 2025
21 Virginia Loss 7-8 1884.1 Jan 26th Winta Binta Vinta 2025
41 American Win 13-8 2217.59 Feb 22nd 2025 Commonwealth Cup Weekend 2
38 Georgia Tech Loss 9-10 1603.38 Feb 22nd 2025 Commonwealth Cup Weekend 2
7 Vermont Loss 6-13 1766.61 Feb 22nd 2025 Commonwealth Cup Weekend 2
30 Notre Dame Win 11-9 2047.06 Feb 23rd 2025 Commonwealth Cup Weekend 2
22 Pennsylvania Win 11-10 2089.07 Feb 23rd 2025 Commonwealth Cup Weekend 2
7 Vermont Loss 7-14 1783.72 Feb 23rd 2025 Commonwealth Cup Weekend 2
**Blowout Eligible

FAQ

What is the uncertainty of the mean?
The uncertainty of the mean is equal to the standard deviation of the set of game ratings, divided by the square root of the number of games. We treated a team’s ranking as a normally distributed random variable, with the USAU ranking as the mean and the uncertainty of the ranking as the standard deviation
What's the algorithm again?
  1. Calculate uncertainy for USAU ranking averge
  2. Model ranking as a normal distribution around USAU averge with standard deviation equal to uncertainty
  3. Simulate seasons by drawing a rank for each team from their distribution. Note the teams in the top 16 (club) or top 20 (college)
  4. Sum the fractions for each region for how often each of it's teams appeared in the top 16 (club) or top 20 (college)
  5. Subtract one from each fraction for "autobids"
  6. Award remainings bids to the regions with the highest remaining fraction, subtracting one from the fraction each time a bid is awarded
Is there a longer explanation of all this?
There is an article on Ulitworld written by Scott Dunham and I that gives a little more context (though it probably was the thing that linked you here)