variations on the coin-kata

Following up on our swarm programming I have written variations of
the change program using depth first search (working off of Greg Bension's example),
breadth first search (which improves performance), and a least common multiple
optimization which improves performance when making change for large amounts.