My original benchmarks were for Eight Queens. I ran some more tests with larger N and found that at N=14, the Tarantella version is the clear performance winner on my machine.
> On Jul 30, 2019, at 7:03 PM, Mark Engelberg <mark.engelb...@gmail.com> wrote: > > Thanks for writing the n-queens code and the blog post. It's great to see > tarantella performing well. > > There's a certain amount of overhead associated with setting up the dancing > links data structure, so I would conjecture that as your problem gets more > complicated (e.g., increasing n), you'd see tarantella become competitive > with the fastest of your hand-rolled implementations. -- 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. To view this discussion on the web visit https://groups.google.com/d/msgid/clojure/6F654488-5D15-4A91-A80C-059FAE1818B8%40gmail.com.
