Hello, Alston!
08.10.2017, 06:55, "CW Alston" <cwalsto...@gmail.com>:
The solution to the puzzle that I wrote doesn't use `amb`. I approached the problemwith `math.combinatorics` & `math.ranges` instead, so I'm not much help there.But I had to wrestle with the same conundrum, regarding compilation in the Listenerversus source file compilation. See if the example helps. I posted the (brief) sourcefile below.
I like your approach using `<k-permutations>`, because it tests fewer combinations towards a solution.
I'd be very interested in an approach using `backtracking`!
I think John posted a perfect one. In fact, I first learned about the `backtrack` vocab from his very own blog posts:
---=====---
Александр
------------------------------------------------------------------------------ Check out the vibrant tech community on one of the world's most engaging tech sites, Slashdot.org! http://sdm.link/slashdot
_______________________________________________ Factor-talk mailing list Factor-talk@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/factor-talk
