Quote:
Originally Posted by nuggetsyl
OK we keep talking about the problem. Now lets work to fix this. Programing challenge. Make a system first can use to set matches. I am not a programer but can something like this work?
1 can only play with a team once
2 can only go againts a team once
3 must have 6 matches between rounds (or 5 if it works better)
|
Here's an algorithm
Code:
del 2007_algorithm
copy 2006_algorithm to 2007_algorithm
Fixed!
Also, your constraints aren't good. At a small regional like waterloo where there are few robots and many (12+) matches to be played, not being able to play a team twice is impossible. 3 opponents * 12 matches is more than the robots at that regional (30 last year). That's why you have to start using less concrete things like "minimize the # of times a given robot plays another", which makes it more difficult. How do you know a given algorithm minimizes that constraint?