I made a code to enumerate pairings in Round-robin tournament. nakaly.hatenablog.com And I found better algorithm written in Ruby. nakaly.hatenablog.com I ported it to Java. gist.github.com

The problem I solved yesterday seems to be pairings in Round-robin tournament. It is called “1-factorization of a complete graph” in graph theory. (according to wikipedia :p) It seems that it has a O(n) solution. nakaly.hatenablog.com

I think a number of patterns of pair programming group is n (odd number) or n-1 (even number) if you have n number of members in you team. I wrote a naive program to enumerate the pattern. gist.github.com