[ANN] tarantella 1.1.1

[Mark Engelberg]

"You won't believe this one weird trick for solving Sudokus and other puzzles."

Tarantella is an implementation of Knuth's Dancing Links algorithm. I demonstrated in my 2017 Clojure Conj talk how it can be used to solve an assortment of puzzles (https://youtu.be/TA9DBG8x-ys) and some of you may have played around with the library after that talk.

I've recently made a number of improvements and refinements, and completely overhauled the README. Those of you with an interest in puzzles and/or constraint programming may enjoy reading through the README and getting a feel for how this library can be applied to certain classes of constraint problems.

Tarantella is also a great case study in the combination of speed and expressiveness you can get by writing a Clojure API for a lower-level implementation written in Java.

https://github.com/Engelberg/tarantella 

[Jason Felice]

This is really nice talk that's given me a bunch to think about.  Thanks!

--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clo...@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+u...@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+u...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/clojure/CAORbMOPOPRZ%3DeJOWT3AKrzrfLTxq%2B4rOrGDpH5DxHLAOB0gxkQ%40mail.gmail.com.

[Steve Miner]

Thanks for updated Tarantella.  I also enjoyed re-watching your talk.  

I just wrote a blog post to cover a simple solution to the Eight Queens problem using Tarantella.

http://conjobble.velisco.com/2019/07/30/tarantella-queens.html

[Mark Engelberg]

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 clo...@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+u...@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+u...@googlegroups.com.

To view this discussion on the web visit https://groups.google.com/d/msgid/clojure/FE9197F8-C372-481D-B32D-2D7B9583F068%40gmail.com.

[Steve Miner]

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.