How did Dancing Links change from the paper? When I implemented it I could not see anything that could possibly be changed, so any improvement would be surprising and wonderful to me.
That's the change to the "basic" algorithm, but he then goes on to add a bunch of new features to basic Dancing Links, modifying it so that it's suitable for different kinds of constraint solving (adding required rows, things like that).
If you've implemented Dancing Links in the past, you owe it to yourself to check out the book version! He also has hundreds of really great exercises about it.