actually, i didn't read the problem fully (sorry) - i just saw that your article seemed to be mainly about embedding boolean variables in integer programming.

actually, i didn't read the problem fully (sorry) - i just saw that your article seemed to be mainly about embedding boolean variables in integer programming. now that i've gone back to read the problem i agree completely - i don't see how to do that (sanely) with boolean logic alone. ps incidentally, with choco (the only CSP/CP solver i've used) you can use regular expressions that make scoring like this very easy (match 5 residential, score ...). http://www.emn.fr/z-info/choco-solver/ http://www.emn.fr/z-info/choco-solver/ - unfortunately (for julia) it's implemented in java. if you're looking for other interesting puzzles, i had a lot of fun with choco and pipes - see items mentioning choco at http://isti.bitbucket.org/ http://isti.bitbucket.org/ or the original so post http://stackoverflow.com/questions/9689436/backtracking-solution-for-programming-exercise-fitting-pipes/9692556#9692556 http://stackoverflow.com/questions/9689436/backtracking-solu...