adventofcode

Happy Advent 2020! Please put answers in the pinned threads or create one if it does not exist yet. | https://github.com/adventofcode-clojurians/adventofcode-clojurians | Join the private leaderboard with code 217019-4a55b8eb
Average-user 2018-12-15T04:20:11.590200Z

I havent had time to do day 14 and day 15 is coming

Average-user 2018-12-15T04:20:30.590400Z

šŸ˜Ÿ

quoll 2018-12-15T05:38:53.591400Z

I just looked at Day 15. It feels like CS homework. ā€œImplement an A* algorithm.ā€ Not really fun

taylor 2018-12-15T06:32:30.592900Z

yeah I donā€™t think I have time in my life to do this one :man-tipping-hand:

taylor 2018-12-15T06:38:40.593300Z

reminds me of a http://codingame.com competition but less fun

2018-12-15T08:23:58.596400Z

I think itā€™s a fun problem, but thereā€™s really too much going on here to finish quickly. Iā€™m 2 hours in and Iā€™m not quite getting the move selection right. I think I need finish in the morning.

gklijs 2018-12-15T09:52:50.598700Z

It would have been more fun if the explanation was less explicit and the actual algorithm a bit more easy. Still it's doable, so I'll will.

gklijs 2018-12-15T10:08:19.599700Z

Just looked at the times for the first 100 to get it right, around 15 minutes for almost any day, but today over 2 hours

2018-12-15T15:18:21.600800Z

My brain is fried. I have a solution but it works really slow for bigger dungeons. I suspect one line of code to be the culprit for making it so slow. Does anyone have the time to check this with me?

2018-12-15T15:19:09.600900Z

(filter (sets/union free enemies)) This is the line of code I suspect will cause trouble for large sets ā€œfreeā€. ā€œenemiesā€ is usually small.

2018-12-15T15:25:55.601100Z

oh. and sets is (:require [clojure.set :as sets])

helios 2018-12-15T15:44:28.601800Z

wow, it's almost 10 hours after the game and then only 835 people solved it completely, compared to the thousands from yesterday šŸ˜„

helios 2018-12-15T15:44:32.602Z

it's a PITA problem šŸ˜„

gklijs 2018-12-15T15:47:29.603100Z

I just got the first part, almost the second but have to go, was the first time I was one of the first thousand to solve the first

gklijs 2018-12-15T15:47:56.603700Z

And with all that state very happy to do it with java..

2018-12-15T16:19:33.604100Z

I've been doing it for about 4 hours, still bug fixing part 1. Grrr.

2018-12-15T16:37:31.604200Z

I tried out tufte yesterday and it seems easy to use out of the box for profiling. https://github.com/ptaoussanis/tufte Wrap the code you want to profile in the p macro and you should be able to see what's hogging the most time.

2018-12-15T17:13:48.604500Z

thanks

2018-12-15T17:35:33.605300Z

i finally finished day 15 and it's pretty rough and slow, but I'm definitly not eager to touch it any further... https://github.com/IamDrowsy/advent-of-cljc/blob/slow/src/aoc/y2018/d15/iamdrowsy.cljc

mfikes 2018-12-15T23:05:24.605800Z

Wow. I might save day 15 for some other day. WTF.

markw 2018-12-15T23:10:12.606200Z

Opened up laptop last night, read day 15, closed laptop.

1šŸ˜1ā˜ļø
mfikes 2018-12-15T23:11:27.607500Z

That problem will likely cost $1000 to solve, in terms of time. You could buy a new laptop.

markw 2018-12-15T23:12:28.607700Z

meanwhile stuck on part 2 of day 13, Iā€™ve looked at this over and over and canā€™t find the bugā€¦ any help would be appreciated! https://gist.github.com/Solaxun/1b4b7ada84b936d43fbee04ede0062f4

markw 2018-12-15T23:12:54.608100Z

Day 15 reminds me of day 11 from 2016 IIRC - the elevator problem

markw 2018-12-15T23:13:23.608700Z

that and the molecules for 2015 were just a beating

2018-12-15T23:53:46.608800Z

Line 66, :locs should be :loc. If you have any collisions that should happen on the first tick they'll get missed. I don't see anything else obviously wrong, so hopefully that's it.

markw 2018-12-15T23:57:49.609Z

you have GOT to be kidding meā€¦ i looked for hours and missed that

markw 2018-12-15T23:57:59.609200Z

that was it.