PairProgrammingCompetitionResults

Pair Programming Competition Results

Well, it looked like it might have come down to strangle holds and figure four leg locks for a while, but a dubious ruling on the CyclomaticComplexity? criteria by yours truly left us with a single winning pair - but more of that later...

We had three pairs for the competition and when the problem was revealed as Code Kata 19, much to my relief none of the participants had completed the problem previously.

After a 90 minute time limit was set on the pairs, development began in earnest and, although each pair had some teething problems (e.g., problems installing the codebase, Eclipse refusing to co-operate, cut-and-paste errors), by the end of the allotted time period, two of the three pairs had completed the acceptance test hurdle requirements so it came down to the lower criteria to adjudge the final winner:

• Acceptance test results: both pairs 100%
• Test coverage results: both pairs 100%
• Simian duplication results: both pairs 0% duplication
• Checkstyle CyclomaticComplexity? results: both pairs had no CC values higher than 4 (and that was from a method supplied by me!)
• Optimization test: neither pair had completed this one (sorry RobertWatkins?, but saying you know what the solution is doesn't cut it :-))

So it came down to a countback on the Checkstyle criteria and, after a bit of discussion, I decided that the RobertWatkins? and PaulOKeeffe? pair had a slightly lower average complexity than the DarrenCotterill and RhysKeepence pair (2.89 as opposed to 3) - hence Robert and Paul were awarded the winning pair of the innaugral XTC PairProgrammingCompetition!

Congratulations to all who participated - I hope you all had fun.

And may the Kata be with you...

p.s. I'd hoped to have lots of piccies of the pairs beavering away, but I was too busy doing pretty much bugger all during the competition and forgot about my camera completely... bugger!

Oh, Andy already added links from PairProgrammingCompetition -- DarrenCotterill