Fork me on GitHub
Vincent Cantin07:12:10

> "Why to type [-1 0 1] when we can just simply (range -1 2) " > -- brainless myself

Vincent Cantin07:12:10

> "Why to type [-1 0 1] when we can just simply (range -1 2) " > -- brainless myself


Yes, but I prefer literals whenever it’s possible. Usually they are easier to read and catch.

Vincent Cantin08:12:54

you misread ... that's sarcasm


😁 less characters and less off by one errors


(juxt dec identity inc)? 😛

👍 4
Daw-Ran Liou12:12:49

(take 3 (map dec (range)))


juxt: full version 😂 ((juxt dec identity inc) (count []))


hehe, I was thinking of using that instead of adding deltas to get neighbours (I do use dec and inc in my solution), so I was actually half serious 😉


i.e., (untested)

(defn cell-neighbors [cell]
  (remove #{cell}
          (apply combo/cartesian-product
                 (map (juxt dec identity inc) cell))))

This should work for any number of dimensions.

👍 1
❤️ 1

Mensa dictionary entry 8: > Sarchasm : The gulf between the author of sarcastic wit and the person   >  who doesn’t get it.

😂 2

did it as an exercise, cause I rarely write macros

👍 1
❤️ 1

did it as an exercise, cause I rarely write macros

👍 1
❤️ 1
Vincent Cantin12:12:29

I did not realize that I could use the multi-arity of = .. thanks !

Daw-Ran Liou12:12:13

Hey I like your typeface! The ligature looks so amazing. What’s the typeface you’re using?

Vincent Cantin12:12:28

it looks like firacode


Yeah, it’s FiraCode by @U050UBKAA

❤️ 2

Can you copy the code, wondering what it does 🙂


hard coded vector of [-1, 0 1]


At compile time?


Depending on the n?


(defmacro adjacent [n]
  (let [ds (repeatedly n #(gensym "d"))
        bindings (mapcat #(-> [% [-1 0 1]]) ds)]
    `(for [[email protected] :when (not= 0 [email protected])] [[email protected]])))

(defn neighbours [adjacent loc]
  (map #(mapv + loc %) adjacent))

(partial neighbours (adjacent 3))


it calculates adjacent locations for n-dimension space.


You can use it like

(def neighbours-3d (partial neighbours (adjacent 3)))

(neighbours-3d [0 0 0])

Vincent Cantin15:12:36

Yeah, the for could be replaced by the list of literal of relative neighbor positions at compile time.


@U8MJBRSR5 can you show how to to do that?

Vincent Cantin16:12:16

I am still at work, I will try to do that after.


I came up with this

(defmacro adjacent [n]
  (let [ds (repeatedly n #(gensym "d"))
        bindings (mapcat #(-> [% [-1 0 1]]) ds)]
    (eval `(vec (for [[email protected] :when (not= 0 [email protected])] [[email protected]])))))

👌 1
Vincent Cantin16:12:16

you don’t need the eval, just evaluate the sequence (and put it in a vector) outside of the backtick.

Vincent Cantin16:12:07

oh .. I see, if you want to use for you can’t have a dynamic n , you will have to use map with recursion … or even better, comp/cartesian-product

Vincent Cantin16:12:23

well .. it works with eval so why not.

Vincent Cantin17:12:19

@U067R559Q you can use this to generate the neighbors:

(defn adjacents [dimension]
  (-> (iterate (fn [coords]
                 (mapcat (fn [coord]
                           (map (fn [x]
                                  (conj coord x))
                                [-1 0 1]))
      (nth dimension)
      (->> (remove (fn [coord]
                     (every? #{0} coord))))

#_(adjacents 2)

(defmacro neighbors [& coords]
  (let [adj (adjacents (count coords))]
    `(->> ~adj
          (mapv (partial mapv + ~(vec coords))))))

#_(macroexpand-1 '(neighbors x y))
#_(neighbors 5 10)


Yeah, it’s also a good option, I saw it in @U076FM90B’s solution. However, I’m happy with two different functions I have. The macro is just for fun.


btw, I found (defn ~name [email protected] ~args ~(apply (eval (list fn args expr)) args))` in clojure.core.

Vincent Cantin17:12:07

yeah, eval is ok during compile time


also, simple approach like this

(defn neighbours-4d [[x y z w]]
  (for [dx [-1 0 1] dy [-1 0 1] dz [-1 0 1] dw [-1 0 1] :when (not= 0 dx dy dz dw)]
    [(+ x dx) (+ y dy) (+ z dz) (+ w dw)]))
works faster then
(defn neighbours [adjacent loc]
  (map #(mapv + loc %) adjacent))
even with predefined adjacent.

Vincent Cantin17:12:40

I made another version, for fun:

(defmacro neighbors [& coords]
  (let [dimension (count coords)
        adj (adjacents dimension)
        coord-vars (repeatedly dimension #(gensym "coord"))
        local-vars (repeatedly dimension #(gensym "local"))]
    `(let [[email protected](interleave coord-vars coords)]
       (mapv (fn [[[email protected]]]
               [[email protected](map (fn [lv cv]
                         `(+ ~lv ~cv))

(neighbors 5 10)


I have lost my steam. Yesterday I had this whole-day testing session at my day work and it left me totally wasted. Stared at step 2 for hours without even understanding the problem. Only one gold star for me there. Today feels the same, with step 1. Might be enjoying this as a spectator sport from now. 😃

🍿 1
❤️ 1

hehe yeah I also feel like that after you lose one day is hard to recover


and I don't really have 1 hour or so every day to dedicate to this sadly (or I only do in the evening but I'm too tired to think)


maybe it should have a couple of breaks to allow people to get back on top of it


I must say that picking aoc up was a great choice of mine. I've learnt so much from tackling the problems, from looking at your solutions, reading your comments, getting your feedback on my solutions, discussing the problems with you, discussing the solutions with you, I could go on. Spent tons of time on it. Do not regret one second. (Except yesterday, when I should have been wiser than to just sit there, staring at my failed reducing, instead of catching some needed sleep.)


yeah absolutely it's great for learning more about Clojure (or any other language tbf)


[2020 Day 17] The hardest part.

🤯 1
Vincent Cantin17:12:55

That’s me !!!


I never really follow sample inputs, just use them to check if my algo gives the correct output for them


Took a look at past results. Interesting to see what day into the month there was an order of magnitude fewer gold stars than the first day: 2020: day 17 2019: day 14 2018: day 18 2017: didn't happen, but got close on day 25 2016: didn't happen, but got close on day 25 2015: day 19

📉 1

To get the gold star for day 25 you don't have new puzzle, it is a bonus star for solving all puzzles of the year


to get *second gold star


yes, the colors are not consistent, one receives two gold stars per day. But there are silver and gold stars on stats page