Have a look at http://www.afronski.pl/sicp-in-clojure/2015/10/05/sicp-in-clojure-chapter-4.html scroll to "Ambiguous operator", this implements searching for combinations in a search space based on the conditions you give it using backtracking,
also as already mentioned you could directly go for logic programming which is also explained in the above post. On Tuesday, 6 October 2015 08:22:42 UTC+2, Alan Moore wrote: > > Not sure it would be a lot more efficient but you could try using > logic/relational programming with core.match, a datalog library or even a > rule engine such as Clara. With the later you can use heuristics to trim > the search space as another poster suggested. > > Good luck. > > Alan > > -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
