exercism

The Clojure Track: https://exercism.io/my/tracks/clojure
jaihindhreddy 2020-04-18T17:06:05.249800Z

BTW has anyone solved Dominoes?

jaihindhreddy 2020-04-18T17:06:25.250300Z

On first look, it seems to be hamiltonian-cycle detection, which is NP-complete.

jaihindhreddy 2020-04-18T17:06:42.250700Z

I'm baffled why it's medium and not hard.

jaihindhreddy 2020-04-18T17:07:16.251500Z

Assuming it is what I think it is, Diamond and Dominoes do not belong in the same difficulty class.

hindol 2020-04-18T18:12:46.252600Z

NP complete means it will take more than polynomial time to run. Maybe the algorithm is still simple.

hindol 2020-04-18T18:19:13.253100Z

By the way #mathematics exists now.

jaihindhreddy 2020-04-18T20:48:57.254400Z

Agreed. naive backtracking is definitely a "medium". But an efficient solution is beyond "hard" 🙂 I was thinking of somehow mapping it to exact-cover and use Knuth's DLX. Is that a decent approach?

hindol 2020-04-18T20:51:25.254800Z

DLX = dancing links?