News for hackers. Stuff that matters.
Re:A CP Solution for XKCD NP Complete Restaurant Order by simias on Tuesday May 28, 2013 @09:32AM (#5779880)
He answers this question in a comment: http://www.roryhart.net/code/xckd-np-complete-restaurant-ord...

Yup though the solver does this for us anyway. Constraint propagation allows the solver to reduce the search space, reducing the domains of variables before traversing the tree.

There are no comments on this comment yet.