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
2018-12-21T00:19:41.826400Z

Or even ^N(N)N$

Average-user 2018-12-21T00:23:59.826500Z

Im only with my phone now, I'll try it later. But there might be some off by ones errors in small inputs

2018-12-21T00:33:18.826700Z

No - it’s actually not your code, it’s that the stack based approach doesn’t work except for on the sample input

Average-user 2018-12-21T01:48:44.826900Z

Is not stack based

Average-user 2018-12-21T01:49:30.827100Z

I think is just a coincidence of names

Average-user 2018-12-21T01:49:47.827300Z

It worked with my input (not sample)

2018-12-21T06:21:45.001800Z

I think I’ve lost interest in aoc entirely. I feel compelled to finish, but today is another non-coding puzzle. YAWN

gklijs 2018-12-21T06:35:09.002100Z

I don't like it eiher

2018-12-21T07:46:19.003500Z

I’m going to sleep on part 2. Maybe I’ll care in the morning. Maybe not. Maybe this is how everyone felt after day 15.

fellshard 2018-12-21T08:08:35.006Z

It does take some code to get part two in a reasonable time. I don't mind as much that the puzzles take different forms; I end up using a lot of code to verify behavior, etc

misha 2018-12-21T08:13:00.006400Z

@norman I don't think ^N(N)N$ is a valid input (within day's rules): (N) does not loop back to where it started, so )N can't follow it.

misha 2018-12-21T08:15:38.006800Z

yeah, today's puzzle is meh

misha 2018-12-21T08:17:26.007600Z

still waiting for today's (day 21) part 2 solution to finish 1st loop 💤

misha 2018-12-21T08:17:52.008Z

as I write this, it is done :opieop:

misha 2018-12-21T08:21:28.008100Z

some day21:P2 stats to help others to debug:

instructions count: 2474020011
loop length: 10711
solution int: 13192622
"Elapsed time: 848641.379538 msecs" = 14 min (with prn, so slower than it is)

fellshard 2018-12-21T08:47:48.008500Z

I started by building the graph in full, then doing a standard BFS w/ 'visited' set, and it completes almost instantly. Are you combining the parse with the search? And does the 'loop' assumption hold in all cases?

misha 2018-12-21T08:49:23.008700Z

are you talking about day 21? : ) because I am. if "yes" how would you build instructions graph w/o simulation?

fellshard 2018-12-21T14:26:52.009300Z

Oops, for some reason I thought this was about day 20 still. :)

Average-user 2018-12-21T14:59:04.010Z

I'm starting doubt some section of my code for day 20. Would someone send me their input and expected results?

borkdude 2018-12-21T15:21:56.010700Z

No solutions for Advent of CLJC day 15 yet. Was that a hard day?

nikola 2018-12-29T23:10:36.115800Z

https://github.com/nikolakasev/clojure-playground/blob/master/src/advent_of_code_2018/dec15.clj, feedback on readability is welcome, I'm learning Clojure while doing AoC.

2018-12-21T15:22:19.011100Z

just long

borkdude 2018-12-21T15:23:05.011700Z

currently re-running solutions submitted so far, so their times are recorded

borkdude 2018-12-21T15:23:06.011900Z

https://circleci.com/gh/borkdude/advent-of-cljc

borkdude 2018-12-21T15:45:25.012400Z

all scores so far. data science anyone? https://gist.github.com/borkdude/d7f42d4110e8a330d1d70f9242b14496

2018-12-21T18:25:47.012500Z

That was the elf-goblin battle. It was a ton of code to write. Looked like very many people disliked the problem.

2018-12-21T20:42:02.014300Z

@misha There wasn’t a rule that things had to loop back to where they started. It just simply happened that the input didn’t

2018-12-21T20:42:46.015200Z

Which is to say, to solve your input, you didn’t actually need to solve the programming challenge