News for hackers. Stuff that matters.
Re:Using Monads in C++ to Solve Constraints: 1. The List Monad by Bootvis on Monday May 11, 2015 @05:01PM (#9527822)
I assume/hope that the big idea for part 2 is that this setup allows for efficiently pruning impossible sub solutions and will result in an optimal algorithm.

Why would you write an algorithm in C++ if the runtime will be bad?

Re:Using Monads in C++ to Solve Constraints: 1. The List Monad by kenko on Monday May 11, 2015 @05:26PM (#9527969)
He even says explicitly "(never mind how we deal with uniqueness)" in the solution section and has already acknowledged that there are only around 2 million combinations to check.

ETA since he mentions the implementation is a translation of this Haskell implementation: http://blog.jle.im/entry/unique-sample-drawing-searches-with... presumably the uniqueness is done by updating the list of remaining possibilities for selection each time a new value is selected.