So has anyone figured out this year’s algorithm? I haven’t taken the time to figure it out yet.
neither have i
it looks so random to me though
It was handpicked by Sean and Dave.
LOL!
Write the team numbers in order on 348 index cards, shuffle three or four times, then deal them into four piles.
Or you could write a program to do the same thing…
they used the same random number generator we used for our autonomous drive code
(oops did I say that?)
Similar to what (http://www.chiefdelphi.com/forums/showpost.php?p=847685&postcount=46) but slightly different. Your method probably wouldn’t produce as much clumping as mine.
Being completely serious I think they just took 4 teams at a time, randomly sorted them, then moved onto the next 4 teams, etc.
It was not sorted by team number, team location or team name. I tried plotting all three to see if there was a pattern, and I didn’t find one. Someone else posted that it wasn’t based on registration date, based on how the last registrants are distributed.
So unless they found some other sorting mechanism, maybe based on some performance criteria such as quals ranking, it appears to be a random assignment. Random would give you strings of teams all assigned to the same division, such as 236 through 271 all being in Curie.
On a hunch, I added together the team numbers from each division to see if there was some pattern. Perhaps the total team numbers might be the same for all divisions?
Team No. Total
Archimedes: 116639
Curie: 110256
Newton: 106945
Galileo: 103721
Apparently, there seems to be no pattern.
i still think that it was done completely randomly
im sticking by it until someone proves what they did to figure it out
Has anyone looked at age of team? Win/Loss Record? OPR/DPR?
Based purely on team number the graph appears somewhat sinusoidal (albeit with pretty bad resolution)
Of course, there is always the chance that it is random which would ruin all fun.
private List<Team> mTeamList = new ArrayList<Team>();
private final static int sNUM_DIVISIONS = 4;
private static Timer t = new Timer("Randomizer");
private static TimerTask divTask = new TimerTask(){
Integer division = -1;
@Override
public void run(){
synchronized(division){
division = (int)(new Random(System.nanoTime()).nextDouble() * sNUM_DIVISIONS);
//Indexes the divisions from 0 to 3, which would match the ordinals of division enums
}
}
public int getDivision(){
synchronized(division){
return division;
}
}
}
static{
initTeamList(); // Populates the team list with teams who are attending Atlanta
t.schedule(divTask, 0, Math.random()*1000);
Iterator<Team> it = mTeamList.iterator();
Timer teamDivTimer = new Timer("Division Assignment");
TimerTask teamTT = new TimerTask(){
public void run(){
if(it.hasNext())
it.next().setDivision(divTask.getDivision();
else
cancel();
}
}
teamDivTimer.schedule(teamTT, 0, Math.random()*1000);
}
Run it, the select random teams to even out the number of teams in each division. 'nuff said
Ok how about that, but in Lamen’s terms
I like how 1114, 2056 and 1503 are in the same division.
I like it only because it’s not my division
Agreed :yikes:
I did something similar; an average of the team numbers in each division.
Team No. Avg.
Archimedes: 1279.42
Curie: 1074.90
Newton: 1062.10
Galileo: 1231.96
I agree there’s no pattern here.
Go Canada! Sorry for the bias.
Bias for the win.
Decided to see if it had anything to do with where teams originated from.
Ori Arc Cur Gal New Tot
AL 0 1 0 0 1
AR 0 0 0 1 1
AZ 2 3 1 2 8
BRA 0 0 1 0 1
CA 9 8 7 10 34
CAN 5 4 0 3 12
CO 0 0 1 2 3
CT 3 3 4 5 15
DE 0 0 0 1 1
FL 7 1 4 3 15
GA 4 1 1 2 8
HI 0 1 2 1 4
IA 0 0 1 0 1
ID 0 1 0 1 2
IL 1 1 3 1 6
IN 2 2 4 3 11
ISR 0 1 2 2 5
KS 0 1 1 0 2
KY 0 0 0 1 1
LA 0 1 0 0 1
MA 3 3 0 3 9
MD 0 1 1 4 6
MEX 0 0 0 1 1
MI 9 16 9 9 43
MN 3 1 0 1 5
MO 4 2 0 3 9
MS 1 2 0 1 4
NC 1 0 2 0 3
NH 1 2 3 1 7
NJ 5 4 9 2 20
NV 1 1 1 0 3
NY 3 8 8 9 28
OH 3 1 2 1 7
OK 3 0 2 2 7
OR 1 2 3 0 6
PA 6 1 2 0 9
PHI 0 1 0 0 1
PR 0 1 1 0 2
RI 0 0 0 2 2
SC 1 2 1 0 4
TN 0 0 1 0 1
TX 5 3 5 1 14
VA 0 2 3 6 11
WA 2 1 2 1 6
WI 2 3 0 3 8
WV 0 1 0 0 1
Tot 87 87 87 88 349
Guess not…