Clojurians Log v2

Trying to brute-force the second part?

https://github.com/Average-user/adventofcode-clj-2018/blob/master/src/adventofcode_clj_2018/day19.clj

Very similar to day 23 of 2017

Day 20… Where to begin…

At room 0,0 with 4 optional doors?

If you print each step you can see a certain pattern. It could take very long for part 2 to complete if you don't change the program.

Quite enjoyed this one. Had to backtrack a bit once I realized I was parsing into a difficult-to-wrangle format.

That’s it!

Again, my solution is really slow… It seems to be making progress, but…

Hmm. I had to cache/memoize a bit. That sped it up a lott, but It doesn’t feel like I should have needed to do that. Maybe it’ll be more obvious in the morning.

Argh! All examples of part one work with my solution but of course the big one doesn’t 🙈

had a different issue, massively misunderstood p2, and wasted like extra hour on it

Ah. I think I know what I did

(time (part-1))
"Elapsed time: 39457.156774 msecs"
3314

memoize it, @lucaspolymeris

Don't know what memoize could workhttps://paste.ofcode.org/iKWt9afh7cWZg5UtPWhXRq

If you analyze the code, the only function that takes real time is nodes-depth

(filter (complement seen) (remove seen)

move might be used many times with same args

I always forget remove, but will just change readability, not performance I think. But thanks anyways

move?

(defn move [dir [x y]]

if you have shared seen - make it transient

ahh right. But the only function that uses move is build-graph. Which takes:

(time (count (build-graph (clean-input))))
"Elapsed time: 77.78829 msecs"
10000

I tracked seen per branch, so could not make it transient, but my move repetitive usage is noticable

(reduce conj seen front)
                 (reduce conj ds (map (constantly depth) front))

I might try to update neighbors, since I will never use one key more than once

so you are doing exhaustive search, and then - select?

not sure what you mean. nodes-length returns the minimum distance between the root and every other node

into doesn't change much btw

but you assign those distances to every known room first

well here is my day 20, is not that efficient but it is concise, I think https://github.com/Average-user/adventofcode-clj-2018/blob/master/src/adventofcode_clj_2018/day20.clj

I like how it came using some string manipulation and the reader:

(defn parse-input [input]
  (-> input
      (str/replace #"[\^]" "[")
      (str/replace #"[\$]" "]")
      (str/replace "|" " | ")
      (read-string)))

still working on actually processing that for the solution though

oops, left the regexes even though I no longer need them

@lucaspolymeris I don’t think yours works. Try “^N(E|)N(E|)N$”

or even “^N(E|)N”