Memorex wrote:So in another thread I was asking about code for finding all the combinations of groups (thanks S2M). I didn't quite get how to use that, but I did end up figuring it out. Anyway, what I was writing was code that would figure out the scenario(s) in which a team could clinch their division the fastest. It's not perfected yet, but given no further bye's for the teams in that division and given no ties, I have it working. So if anyone wants to know when their team can clinch, and how they can do it the fastest, ask away.
In baseball it is easy.
G + 1 - W(a) - L(b)
no need of a punnett square, map graph or any other such nonsense...
Where G = total games in the season(162) + 1 minus Total wins by leading team minus total loses by 2nd place team....
162 + 1 - 90 - 67 = Magic # of 6
It may work for Football....As far as NE and NY...leaving the Bills out of the equation for now - each team has a magic # of 9. Meaning 5 NE wins plus 4 NY loses, or vice-versa....looks like the fastest either team can clinch would be week 14(or teams' 13th game)