Solving the NYTimes Pips puzzle with a constraint solver

It's pretty neat that in practice "NP-complete" problems are often just easy. I ran into a similar issue with a scheduling problem a few years ago where we wanted to find the optimal order of doing some tasks (pointing a telescope at a set of locations) and it ended up being much easier than we expected. (Although that was a MIP solver instead of a constraint solver.)