Fork me on GitHub
#adventofcode
<
2016-12-24
>
angusiguess17:12:29

@bhauman I really like the use of iterate in your solutions. Most of my searches are still loop-recurs, that's a really cool way to structure search.

bhauman17:12:38

@angusiguess thanks! iterate allows you to operate on the list of individual states that result from each step, loop has less overhead but requires more thinking 🙂

bhauman17:12:04

I'm working on day 24 right now

angusiguess17:12:16

Yeah, that's the bit. Any time I could prevent some heavily nested destructuring would be nice.

angusiguess17:12:38

24 is pretty good. I really liked 23 too, a lil' bit of manual jitting

bhauman17:12:39

@angusiguess I looked at you stuff the other day, the other thing I would recommend is to take advantage of read-string 🙂

bhauman17:12:58

nothing like having your own parser

bhauman17:12:17

er I mean reusing clojures powerful parser

angusiguess17:12:15

Hahaha, yeah there's a lot of regular expression use in there admittedly.

bhauman17:12:16

when I read 24 I was like really, that seems like a lot of work

bhauman17:12:34

but here goes

angusiguess17:12:03

Luckily you've probably got loads of bfs code already written