I'm not sure if I understand what you want, but it might be something related to this thread.
http://www.perlmonks.com/?node_id=671445 The task described there is to organize a tournament between 25 people where in each match, 4 people compete against each other, no two people can share more than one match, and you want to maximize the number of matches. One example result (but not the optimal one) is this. ABCD AEFG AHIJ AKLM ANOP AQRS ATUV BEHK BFIL BGJM BNQT BORU BPSV CEIM CFHN CGKO CJLP CQUW CRTX DEJN DFKP DGHL DIOQ DMRV DSTW ELOS EPQX FJOT FMSU FVWX GINR HMOW IKSX JKQV LNUX That's not an easy problem, but at least I could use J to get an approximating solution. Ambrus ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
