Or even ^N(N)N$
Im only with my phone now, I'll try it later. But there might be some off by ones errors in small inputs
No - it’s actually not your code, it’s that the stack based approach doesn’t work except for on the sample input
Is not stack based
I think is just a coincidence of names
It worked with my input (not sample)
I think I’ve lost interest in aoc entirely. I feel compelled to finish, but today is another non-coding puzzle. YAWN
I don't like it eiher
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.
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
@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.
yeah, today's puzzle is meh
still waiting for today's (day 21) part 2 solution to finish 1st loop 💤
as I write this, it is done :opieop:
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)
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?
are you talking about day 21? : ) because I am. if "yes" how would you build instructions graph w/o simulation?
Oops, for some reason I thought this was about day 20 still. :)
I'm starting doubt some section of my code for day 20. Would someone send me their input and expected results?
https://github.com/akovantsev/adventofcode/blob/master/src/adventofcode/2018/day20.clj#L90-L96
No solutions for Advent of CLJC day 15 yet. Was that a hard day?
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.
just long
currently re-running solutions submitted so far, so their times are recorded
all scores so far. data science anyone? https://gist.github.com/borkdude/d7f42d4110e8a330d1d70f9242b14496
That was the elf-goblin battle. It was a ton of code to write. Looked like very many people disliked the problem.
@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
Which is to say, to solve your input, you didn’t actually need to solve the programming challenge