Quote:
|
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?
|
Simple. You could write a code that you can change variables based on those 3 principals that nuggetsyl suggest so it works better for each regional.