Begin #170 hard in Clojure

This is harder than it looks.
Begin #170 hard in Haskell

This is super hard in haskell, because it needs randomness, and thus IO,
which I have not learned yet.
About to remove atoms
Everything's done except the sorting and pairing

Pairing is a tricky business, because there are two constraints; the
Swiss tournament rules say the highest scoring players across all games
always pair up (and in the event of a draw, a tie-breaker can fill in,
such as adding up all of their opponent's scores against them), but the
Danish variation states that players can only play each other once. As
people on the thread¹ are finding out, these two restrictions, combined
with greedy pairing while walking the list by highest score pairings,
can lead to dead ends, where the final players by score pairing have
already played one another. This is a hard one to solve.

¹ http://www.reddit.com/r/dailyprogrammer/comments/2afwlj/7112014_challenge_170_hard_swiss_tournament_with/
Fix arg name in make-player in 170_hard.clj
Move tally down in 170_hard.clj
Add already-played function to 170_hard.clj
Tally sort pair-players-by-scores in 170_hard.clj

This doesn't fix anything, but I just wanted it to sort on something.
Add formatted output
Add todo and give up - too busy right now
Merge branch '170_hard' (incomplete)
Merge remote-tracking branch 'refs/remotes/origin/master'