A CP Solution for XKCD NP Complete Restaurant Order

Re:A CP Solution for XKCD NP Complete Restaurant Order by andrewcooke on Tuesday May 28, 2013 @09:42AM (#5779952)

cp is fascinating. if people are interested, here's a write-up from a similar exploration, using choco (a constraint solver in java) to solve a problem on stackoverflow:

write-up - http://isti.bitbucket.org/2012/04/07/pipes-clojure-choco-5.h...

problem - http://stackoverflow.com/questions/9689436/backtracking-solu...

and another problem on stackoverflow that i was going to solve with cp, but which ended up being analytic - http://stackoverflow.com/questions/7076349/is-there-a-good-w...

[ Parent | on HN ]

Re:A CP Solution for XKCD NP Complete Restaurant Order by nickknw on Wednesday May 29, 2013 @12:44AM (#5784630)

I agree, it is! I did a light comparison[0] between a logic programming solution to sudoku (Prolog) and one using constraint programming (Scala + JaCoP). I thought Prolog was a little nicer because it was shorter and more declarative, but the JaCoP solution was still great compared to any non CP-solution.

[0] - http://nickknowlson.com/blog/2012/08/06/seven-languages-week...

[ Parent | on HN ]