Bob Hearn (BA ’87) currently spends most of his time running very long distances. He has been involved in a number of startups, most successfully when he co-wrote ClarisWorks with Scott Holdaway (BA ’87), and sold it to Claris. Then he headed to MIT for a PhD in Computer Science, studying artificial intelligence and computational complexity. His Nondeterministic Constraint Model of Computation, developed with Erik Demaine, helped launch the popular sub-field of theoretical CS known as Combinatorial Reconfiguration. This work is further expanded in their book “Games, Puzzles, and Computation”.