View Single Post
  #14   Spotlight this post!  
Unread 04-03-2007, 03:33
Cory's Avatar
Cory Cory is offline
Registered User
AKA: Cory McBride
FRC #0254 (The Cheesy Poofs)
Team Role: Engineer
 
Join Date: May 2002
Rookie Year: 2001
Location: Redwood City, CA
Posts: 6,800
Cory has a reputation beyond reputeCory has a reputation beyond reputeCory has a reputation beyond reputeCory has a reputation beyond reputeCory has a reputation beyond reputeCory has a reputation beyond reputeCory has a reputation beyond reputeCory has a reputation beyond reputeCory has a reputation beyond reputeCory has a reputation beyond reputeCory has a reputation beyond repute
Send a message via AIM to Cory
Re: "Random" match Schedules

Quote:
Originally Posted by Gabe View Post
For this amount of trouble, lets step away from algorithms and any other sort of computerized system, as any kind of solution is bound to result in patterns, which we want to avoid to have a fair game.

This is my solution, and a very simple one. For each regional FIRST should buy popsicle sticks for as many teams as are attending. If there are 48 teams for the SV regional, FIRST buys 48 popsicle sticks. Each stick will have one team number written on it. Then they are all placed into a corrugated cardboard box with a lid. You shake the box really hard for five seconds, and then open it. Without looking, a person picks out sticks three at a time, forming alliances. After all of the sticks have been picked and having recorded the alliances, all 48 sticks are placed back in the box and the process is repeated as many times as necessary.

For added effect I suggest that the choosing of alliances be done in plain view of all of the teams. This will generate a lot of excitement as well as doing away with any doubt of having truly "random" match schedules.

(I think this is a realistic and fair way of chosing alliances.)
1) This is a waste of time. Volunteers and/or FIRST staff have much better things to be doing with their time.

2) You'll end up with teams playing a match, and then a second match, without enough time between the two. Hence the need for an algorithm.

Last year's algorithm, or plenty that have been posted by users here on CD would be fine. Anything but what we have now.
__________________
2001-2004: Team 100
2006-Present: Team 254