What I mean by only having four options refers to the fact that competitor A1 cannot compete against two members of another school, thus violating rule #1. You are correct in saying that A1 has more than four possible groupings.
I haven't tried to keep track of each panel (yet) but I do like your idea. The reason my solution doesn't really work is because I was just making and shifting rows back and forth, much like a bad carnival game with ducks on a track.
My question, I suppose, is trying to find out 1) is there a simple (or complex, but doable) mathematical solution to find matches (factorials just tell you how many possible combinations, but not unique combinations for each unit). 2) is there a better way to structure a program to fill these panels.
I like your idea of keeping track of each user/panel. I'll have to think about that one for a little while.
In reply to Re: Re: Perl for Adjudication
by dejoha
in thread Perl for Adjudication
by dejoha
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |