cl-containers VS aoc

Now the main mutable state in my A* function is the use of cl-containers's priority queue. I might see if Sycamore's pairing heap is a suitably-performant pure-functional replacement.

We're using cl-containers [1] and cl-graph [2] and to make it very fast lparallel [3] and rtg-math [4] (among many others)

[1] https://github.com/gwkkwg/cl-containers

1076/1738 — Raw solution (to refactor/possibly rewrite)

Solution

Busy day today, going back to sleep zzZZZ. Clean solution and walkthrough here later today (hopefully).

If you're using Python, you can check this guy walkthroughs, he's good at explaining things and uses many Python's features to write clean code. I'd suggest to try tackle a problem on your own, and whether you manage to get a solution or not, read his walkthrough, and re-implement a solution using his ideas. This is what I did two years ago and it was a big help for me, I was more and more able to come up with solutions without looking at what he did. I still check what he does today, but I always solve the problem on my own first now.

758/2614 — Soluzione Python 3 — Walkthrough (inglese)

Solutions and walkthroughs for most of the years.

Congrats /u/skifire13 per il rank #233 globale, nice!