AoC can be very time-consuming.
#advent-of-code
fossil cipher
whether it's struggling to find an working solution... or wondering if you can improve what you have... it can be a real time vampire π
modern terrace
whether it's struggling to find an working solution... or wondering if you can i...
the former is uncontroversially the hardest one
magic oxide
it took me like 2 weeks after the new year to finish last year's aoc
hoping that won't happen again this year
lunar jackal
how are people solving with brute force in 1 minute
took me like 10mins
didn't help that my y position was 3.1mil
hidden musk
nah. almost screwed me with exams lol
feral hazel
how are people solving with brute force in 1 minute
took me like 10mins
didn't h...
my initial solution took me 14 minutes because I was reparsing the input on every loop
molten pasture
Or smart pants code
I could do it thanks to a smart part 1 function
Basically I have to check every row, but checking each row is very fast
It takes a minute to bruteforce with plain python and 7 seconds with pypy
halcyon junco
Iβm on day 5. Would it be cheating to manually enter the initial values for the stacks?
rapid wolf
no, but it makes the problem a bit less interesting IMO.
halcyon junco
Iβm so bad at working with this kind of stuff lol
Wait I might have an idea actually lol
hollow wharf
Tomorrow's twist is that the distress signal is coming none other than from the trapped elves
hidden musk
π
halcyon junco
The ideal/correct way to solve Day 7 ||the file system one|| is with ||recursion|| right?
Just wanna double check before I throw myself down this rabbit hole
pine tiger
yeah
torn thorn
The ideal/correct way to solve Day 7 ||the file system one|| is with ||recursion...
it's one way
depends on how you setup your filesystem
past comet
is there somewhere I could get more test inputs for day 14?
low condor
is there somewhere I could get more test inputs for day 14?
is your code working for test but not real input?
past comet
no, I realize now I had the same off by one in both cases, but I'd misread a 94 for a 93 so I thought I was passing the test case
sharp panther
you know, generating test inputs for fun would be kinda cool
naive stone
is there somewhere I could get more test inputs for day 14?
you can authenticate for advent of code in the other ways it provides and you'll have a chance to get different inputs for each of those accounts
past comet
this should give 4 for part 2 498,2 -> 502,2
well, I think that's enough for me today
need to swap out for automated tests instead of visually inspected ones :/
pine tiger
you know, generating test inputs for fun would be kinda cool
generate some 2019 intcode test inputs
broken cradle
Somehow managed to crash my computer by using all of the memory on part 2 today
compact wasp
either low ram or you actually brute forced it
broken cradle
16 gb
tepid cairn
download more RAM π€
compact wasp
yeah you def did it wrong
broken cradle
Yeah I assumed so
I started running it then I took another look at those numbers and was about to stop the program π
broken cradle
Thereβs gotta be some kind of math that I donβt know that would make this easier
compact wasp
π
broken cradle
it's literally algebra
I don't get how π
compact wasp
turn the manhattan distance into an equation
boom, now you have a system of equations
i will refrain from revealing how you solve that system
agile dew
Symbolab
agile dew
ty
magic oxide
are you in middle school? otherwise you should know
tbf my brain also shut down at 1am last night and I forgot how to solve for intersection points so I ended up messing with algebra for like 20 minutes before I remembered you can separate vector equations into component equations
agile dew
wait where is the question
compact wasp
compact wasp
tbf my brain also shut down at 1am last night and I forgot how to solve for inte...
π
i guess understandable since it was 1 am
but π
agile dew
oh this is way outta my skill level lmfao
agile dew
im struggling with roman to integer rn
magic oxide
I was like "ok the lines are perpendicular so we can take the dot product of the direction vectors" and then I realized that was stupid because I already knew the direction vectors
compact wasp
lol
agile dew
we're still in freelo mode
π
magic oxide
and then I was like "I have three unknowns and two equations I think this is impossible"
and I got stuck on that for like 10 minutes
compact wasp
π
misty oriole
yo
i need help
im trying to code a bot for discord but I cannot figure out how to make a /set channel command and /set role command. if someone could help that would be amazing.
compact wasp
wrong channel
covert arrow
im trying to code a bot for discord but I cannot figure out how to make a /set c...
#βο½how-to-get-help you should ask in #1035199133436354600 or #discord-bots instead
broken cradle
welp, looks like it's hit the part where it's beyond my skill level
broken cradle
I get systems of equations and stuff but idek how I would find ||a missing point out of a bunch of squares||
compact wasp
intersection of lines
you push them by 1 unit and then find where 4 of them intersect
basic algebra frfr
broken cradle
magic oxide
you push them by 1 unit and then find where 4 of them intersect
how'd you find ||where 4 of them intersect btw||
because I just ||iterated over all combinations of length 4 of all the rhombus sides and then all 64 permutations of the 4 sides of the 4 rhombuses and I feel like it was really inefficient||
compact wasp
oh i did not do the algebraic approach
magic oxide
oh
I tried brute forcing and it took like a minute to just do 20k rows so I figured my laptop wasnt built for that
dusky geode
Hello, guys. I don't know where to ask. I'm firmly stuck on Day 11, part 2 (those monkeys). And the only question I have is if linear algebra knowledge is required to solve this. If yes, I'll just calmly give up. I don't want spoilers, otherwise would just have looked at the forum thread.
modern harness
Does anyone know how to search the threads? Someone posted a neat coord class the other day that I wanted to look back at.
Not sure which day, but even if I knew the day, I'm really not seeing any way to search it
modern harness
Hello, guys. I don't know where to ask. I'm firmly stuck on Day 11, part 2 (thos...
Whats the issue you're running into?
covert arrow
Hello, guys. I don't know where to ask. I'm firmly stuck on Day 11, part 2 (thos...
nope, this line from the puzzle might be helpful: ||You'll need to find another way to keep your worry levels manageable.||
magic oxide
Not sure which day, but even if I knew the day, I'm really not seeing any way to...
best you could do is just search #1047673173447020564
covert arrow
search for "class coord" maybe?
magic oxide
maybe restrict the days to ones that actually had coordinates in the puzzle
modern harness
best you could do is just search <#1047673173447020564>
I don't see a way to search that in the side bar. There is a search bar that comes up when you click that just for searching the threads, but that only searches the thread TITLES, so unless I'm searching for "AoC" or "Day" or "Solutions" it doesn't bring up anything
earnest forge
Does anyone know how to search the threads? Someone posted a neat `coord` class ...
You just search in 'advent-of-code-spoilers' and it gives you results for all of the threads
covert arrow
use the default discord (server-wide?) search
earnest forge
This is probably the message you mean: https://spoiler.discord.com/channels/267624335836053506/1050641552524976129/1050853357721485422
modern harness
Thank you, thought I had tried that already
earnest forge
use the default discord (server-wide?) search
Doesn't need to be server-wide, searching in a forum channel brings up all threads in that channel
dusky geode
nope, this line from the puzzle might be helpful: ||You'll need to **find anothe...
Thanks! I am not desperate enough to look at the spoiler just yet π Will continue thinking.
earnest forge
Thanks! I am not desperate enough to look at the spoiler just yet π Will contin...
The spoiler is quoting directly from the puzzle, we're just not supposed to write it in cleartext
dusky geode
Whats the issue you're running into?
Worry levels reach "unmanageable" values, as written in the task. I tried to use symbol math to see what's happening and could not find anything useful, like, for instance, dividers "accumulating" in the worry levels, to reduce those. Also I calculated worry levels of an item for the first 100 rounds and printed some first dividers of those. Cannot see any pattern.
I will continue thinking, thanks for asking.
dusky geode
The spoiler is quoting directly from the puzzle, we're just not supposed to writ...
I do understand that.
feral hazel
This is probably the message you mean: https://spoiler.discord.com/channels/2676...
this is fine but I'd probably freeze the dataclass instead of making a hash function```py
from dataclasses import dataclass
@dataclass(frozen=True, order=True)
class Coord:
x: int
y: int
I can give you more hints (without giving it away), but we should probably have the discussion in Day11 Solutions&spoilers
earnest forge
I can give you more hints (without giving it away), but we should probably have ...
I think that it actually makes more sense to use individual spoiler tags, so that they can choose to reveal them when they decide they want the hint
modern harness
I think that it actually makes more sense to use individual spoiler tags, so tha...
in advent-of-code (small hints, spoiler stuff like this, nothing major)
You're right, this is the perfect place for small hints
feral hazel
this is fine but I'd probably freeze the dataclass instead of making a hash func...
having a mutable class with a hash function like that could lead to wonky behaviour like
earnest forge
Worry levels reach "unmanageable" values, as written in the task. I tried to use...
For what it's worth, here are a couple of small hints towards the puzzle
Rephrasal of your problem: ||You need to reduce the size of the numbers, while not affecting the divisibility checks of any of the monkeys||
Example case to think about: ||Given monkeys that check divisibility by 3 and by 7, what do 2 and 83309 have in common, and why?|| ||Can you transform one into the other?||
feral hazel
!e
from dataclasses import dataclass
@dataclass
class Coord:
x: int
y: int
def __hash__(self):
return hash((self.x, self.y))
a = Coord(2, 3)
s = {a}
a.x = 4
print(a in s)
marsh currentBOT
@feral hazel :white_check_mark: Your 3.11 eval job has completed with return code 0.
False
Why did you set order btw
feral hazel
you can compare it like a tuple
earnest forge
Points shouldn't have an order for the same reason complex doesn't
earnest forge
you can compare it like a tuple
(if you want tuple comparison, just use a tuple)
feral hazel
ah I like having it as a class because I can add methods to it```py
@dataclass(frozen=True, order=True, slots=True)
class Point:
x: float
y: float
def rotated(self, angle_deg: float, pivot: Optional[Point]=None) -> Point:
if pivot is None:
pivot = Point(0, 0)
px, py = pivot
x, y = self.x - px, self.y - py
angle_rad = radians(angle_deg)
s = sin(angle_rad)
c = cos(angle_rad)
x, y = c*x - s*y, s*x + c*y
return Point(x + px, y + py)
def __iter__(self):
return iter([self.x, self.y])
def __getitem__(self, i):
return [self.x, self.y][i]
def __repr__(self):
return f"({self.x:+.02f}, {self.y:+.02f})"```
Inherit from namedtuple?
feral hazel
that would indeed work
yeah looks good but it feels weird inheriting from something in typing```py
from future import annotations
from typing import NamedTuple, Optional
from math import radians, sin, cos
class Point(NamedTuple):
x: float = 0
y: float = 0
def rotated(self, angle_deg: float, pivot: Optional[Point]=None) -> Point:
if pivot is None:
pivot = Point(0, 0)
px, py = pivot
x, y = self.x - px, self.y - py
angle_rad = radians(angle_deg)
s = sin(angle_rad)
c = cos(angle_rad)
x, y = c*x - s*y, s*x + c*y
return Point(x + px, y + py)
I meant inheriting from the collections version lol
from collections import namedtuple
class Point(namedtuple('Point', 'x y')):
...
ah I think I prefer the syntax of the typing one though
the attributes also don't have types unless you do what you'd do for NamedTuple
earnest forge
(you can type-hint the members even if you inherit from collections namedtuple)
((just don't set a default))
feral hazel
unless you do what you'd do for NamedTuple
earnest forge
(((in fact don't do that anyway it messes with your type checker)))
Anyway glhf everyone, puzzle drops in 2 minutes!
torn thorn
&aoc c
shut trellisBOT
Day 16 starts <t:1671166800:R>.
feral hazel
yep lego
earnest forge
I mean I could have done that if I could be bothered
<t:1671166800:R>
You're welcome
compact wasp
alright it is time for me to get fucked by day 16
compact wasp
according to my calculations, i will place in 4 digits
compact wasp
pretty much every even day i place in 4 digits, and every odd day i place in 3 digits
shut trellisBOT
<@&518565788744024082> Good morning! Day 16 is ready to be attempted. View it online now at https://adventofcode.com/2022/day/16. Good luck!
torn thorn
ew
tidal bloom
torn thorn
is this more graph problems
earnest forge
I think you might be right
stable shale
Doesn't look like a plain graphing problem. This is gonna be...interesting
torn thorn
isn't this just a ||wandering salesman||
compact wasp
π
earnest forge
I figured out the optimisation lol
earnest forge
Nvm it didn't work
torn thorn
i feel like its like a ||weird type of pathfinding||
torn thorn
question: ||will you always want to open the current node before traversing to another tunnel||
no you won't
damn
modern terrace
question: ||will you always want to open the current node before traversing to a...
||if its flow value is not 0, ig?||
torn thorn
||if its flow value is not 0, ig?||
no
modern terrace
you literally ||just leave it at wherever the last place to open something is||
torn thorn
||go to 1 -> open 1 -> go to 30 -> open 30 vs go to 1 -> go to 30 -> open 30 -> go to 1, second is better because you have an extra minute to relieve pressure||
compact wasp
imagine this is ||mcts||
compact wasp
||monte carlo tree search||
torn thorn
||explanation of how it works?||
modern terrace
i guess ||calculate cost using how near the valve is and how much flows from it||
this is a ||web|| and not a ||tree|| isn't it?
stable shale
A grand total of 2 people in here have solved anything for today. Me concerned
torn thorn
yeah naive solutiosn won't work for part 1 idt
compact wasp
yeah i've tried
stable shale
I gave up even trying to implement the naive solution
compact wasp
it does not work
modern terrace
i don't even have a solution yet
torn thorn
same
stable shale
Honestly just gonna wait for the Reddit thread to open and smart people to explain how to do it
torn thorn
not many people do
stable shale
I'm betting it's some math trick
modern terrace
i ust wanna find a way to ||calculate the cost of the valve distance with its flow rate|| and somehow use that
that's the only problem if i understand correctly unless ||lookaheads|| are required
torn thorn
i ust wanna find a way to ||calculate the cost of the valve distance with its fl...
oh that's interesting
compact wasp
pruning via ||cycle detection||?
stable shale
Probably wouldn't help
devout tusk
||Seems like a version of knapsack today? Yay or nay? ||
pine tiger
how would that work
torn thorn
||any way to do memoization based off of open valves/minutes_left||
modern terrace
i'm just using chatgpt
torn thorn
π
stable shale
i'm just using chatgpt
Same lmao. I'm trying anything to get a semblance of a clue as to how to calculate this
modern terrace
i can't think of anything because i'm not an algorithm solver especially when there are paths
devout tusk
Protip : ||Calculate by hand β π ||
torn thorn
WAIT
stable shale
Is that actually doable?
torn thorn
||is 1e16 combinations too big||
stable shale
I'm just gonna do this tomorrow when all the smart people've figured it out. Good night and good luck
devout tusk
||is 1e16 combinations too big||
That's just about the amount of metres a light year has. So..... it's kinda big lol
compact wasp
||is 1e16 combinations too big||
honestly a lot less based on "common sense"
torn thorn
||it'll be the upper bound||
||at most subsets of 15 from 66 different sets, and 30 different minutes for each||
compact wasp
here's my graph btw
torn thorn
wait
compact wasp
obviously a lot less than 1e16 from common sense
torn thorn
yeah
modern terrace
for all i know ||wandering salesman needs to return to its original point||
torn thorn
||also wandering salesman doesn't want to repeat nodes right?||
modern terrace
this ||does not||
wet yoke
There's only a few worth reaching to release any pressure, it seems.
All but 15 are flow rate 0 on mine. π€
covert arrow
||all the flow rate 0 valves (except AA) seem to have 2 paths, would flattening these paths help?||
torn thorn
||yes probably||
pine tiger
think that would harm more than help
limber aurora
There's only a few worth reaching to release any pressure, it seems.
All but 15 ...
||same for mine||
torn thorn
here's my graph btw
what program did you use
compact wasp
||all the flow rate 0 valves (except AA) seem to have 2 paths, would flattening ...
for sure
compact wasp
what program did you use
networkx + plt
wet yoke
My eyes so far
compact wasp
things are more visible in this one
torn thorn
things are more visible in this one
can you try to filter out the
things
with flow 0
compact wasp
actually wait, i should try flattening paths
covert arrow
I already did
hollow wharf
can somebody helpe me with 11 part 2?
covert arrow
||eg if you had AA <-> BB <-> CC but BB has flow rate 0 you can flatten it to AA <-> CC which takes 2 minutes to travel through||
hexed axle
devout tusk
Idk about that but @compact wasp 's graph sure is pretty sus. Looks like an amogus if you look the right way
compact wasp
graph is undirected
hollow wharf
can somebody give me a hint for 11 part 2?
i dont want to look at the spoilers and ruin it
but im getting increasingly worried this is some math trick
hollow wharf
oh hell
modern terrace
what's an optimal way to ||combine cost of valve and length of path|| because i'm doing that rn
wait i got it
valves are opened right as they should be
torn thorn
||you can multiply time left by the flow amount to get the total pressure you'll relieve at any time||
modern harness
My part 2 is both wrong on the example AND takes a really long time just for the example. I'm surprised its so much worse than part 1 in terms of timing.
modern terrace
||you can multiply time left by the flow amount to get the total pressure you'll...
ik
leaden kettle
should i turn off github copilot for advent of code?
feels like cheating so im going to, but also it helps with some tedious parts when im problem solving
torn thorn
do what you want to do
torn thorn
ok i'll try to make a cache
RIP computer memory
im gonna come back to a blue screen
hollow wharf
it is a math trick
can you give me a hand?
magic oxide
think about some operation that you can do to make the numbers smaller, but their divisibilities by all the monkeys remain invariant
hollow wharf
i can think a few, but they would involve not reusing my part 1 solution, right?
the time consuming op is the squaring operation, but the other ones alter the numbers enough to make each step different
or am i timing it wrong? is the division that is overtaxing?
hollow wharf
think about some operation that you can do to make the numbers smaller, but thei...
all the divisions are prime
but i need to pass the squared numbers to the next monkey, else if they are not squaring i dont get the real answer
magic oxide
wdym but why
hollow wharf
why does it work
i changed my //3 for a modulo for the lcm
by cheating
i don't get why it works
some monkeys do addition
magic oxide
adding two numbers and then taking mod n is equivalent to adding the two numbers mod n
same with multiplying
earnest forge
adding two numbers and then taking mod n is equivalent to adding the two numbers...
Technically not quite true but yes
magic oxide
Technically not quite true but yes
same residue mod n whatever
basically it stays the same
magic oxide
sure
hollow wharf
but i would expect to have to multiply the result
ooh
but the result is the times visited
earnest forge
This is why modulo arithmetic is often introduced as 'clock arithmetic'
magic oxide
multiplication also preserves it
hollow wharf
i see it now
earnest forge
but the result is the times visited
Yeah, result is nothing to do with the numbers being modulod
hollow wharf
yeah i see it now
i don't care about the actual numbers passed around, im just counting the pass arounds
i assume by that that there might be even better solutions?
where you don't even have to model the actual rounds?
compact wasp
π
earnest forge
Some people did cycle-tracking solutions to skip most of the rounds
But AFAIK that's the only way of skipping computation
hollow wharf
wdym by cycle-tracking?
earnest forge
A -> B -> C -> D -> A -> B (cycle detected, BCDAB)
The key observation is that once an item passes a divisibility check once, it will always pass the divisibility check
hollow wharf
The key observation is that once an item passes a divisibility check once, it wi...
wdym?
the items change number on all passes
ooh
you mean when they cycle back to a monkey they regain the divisibility?
earnest forge
The key observation is that once an item passes a divisibility check once, it wi...
Wait I'm dumb I forgot that they're allowed to add LMAO
magic oxide
lmao
magic oxide
This is why modulo arithmetic is often introduced as 'clock arithmetic'
I got introduced into modulo arithmetic in like the completely wrong direction
my first official theorem I learnt was fermat's little theorem
and then I had to backtrack and figure out a lot of the stuff about modular addition and multiplication myself
hollow wharf
did you do cs?
magic oxide
I'm not in uni yet
hollow wharf
will you be going into cs?
real belfry
Hello?
lost owl
I'm more of a math guy tho tbh
math is better than cs 
cyan sleet
cs is very mathy
if you go into cs expecting just a bunch of programming you're gonna have a bad time π
hollow wharf
yep
fossil cipher
CS doesn't even like programming.
CS: I have created this wonderful algorithm
Programmer: Cool, how do we implement it?
CS: Sir, I think you should leave.
cyan sleet
CS doesn't even *like* programming.
bold statement
fossil cipher
One lecturer I had was an amazing computer scientist. extremely knowledgeable. His programming skills weren't amazing lol (by their own admission, too)
rapid wolf
yeah, programming is fairly different from the more theoretical nature of CS research.
hidden musk
if you go into cs expecting just a bunch of programming you're gonna have a bad ...
my school has "IST" which stands for like..information something and tech? but they basically just do CS without the math
hollow wharf
without the math??
hollow wharf
my school has "IST" which stands for like..information something and tech? but t...
how can u do cs without math
cs is basically math
proud cosmos
I'm struggling so hard
I don't see how I'd optimize this past brute force and guessing
magic oxide
do it by hand π
magic oxide
my school has "IST" which stands for like..information something and tech? but t...
I had that as well
was really kinda just do whatever you want related to programming
and if you could like write bare minimum python you'd be ok
not really related to cs too much
no algorithms or anything
closest thing would've been binary
pure saddle
Does anyone know how do I unsub from aoc pings?
magic oxide
you get pinged for aoc?
pure saddle
Yea
But i haven't got the time recently to solve the newer ones so the pings were a bit annoying
minor cave
Does anyone know how do I unsub from aoc pings?
!subscribe the self assignable roles are managed by python
pure saddle
!unsub
pure saddle
`!subscribe` the self assignable roles are managed by python
Thanks!
limber aurora
im really confused how to use the aoc module that lets you get your puzzle input directly
this is the module but i don't understand what oc is or what i need to do to do to be able to link it to my account and use it
tepid cairn
https://pypi.org/project/aoc/
so, that's not an aoc helper
!pip aoc-lube maybe take a look at this? It's pretty neat
marsh currentBOT
limber aurora
so, that's not an aoc helper
oh woopsies, i saw somone else use "import aoc" so i assumed that it was
minor cave
this is the other helper package folks use
https://pypi.org/project/aoc-helper/
limber aurora
(this was at the start of their code)
tulip harbor
What's the basic approach I should be taking with day 12? I know it's finding shortest path but I don't really know where or how to start.
(I want to know what to do without knowing how to do it π )
viscid elbow
What's the basic approach I should be taking with day 12? I know it's finding sh...
||BFS||
dense osprey
my school has "IST" which stands for like..information something and tech? but t...
my school has it as a subject but we have been doing excel for the past 3months
compact wasp
nah today was great
i like how everyone was slow, let me place higher on the leaderboard
pine tiger
i hate you \s
open ice
One lecturer I had was an amazing computer scientist. extremely knowledgeable. H...
Y'all should watch "The Two Cultures of Programming" by Joshua Ballanco
Extremely insightful
compact wasp
i hate you \s
i was somehow the first person on this server to finish p2
no clue how that happened
candid berry
I had a ton of trouble getting part 2 working
My ||dynamic programming|| approach for part 1 didn't work out at all for part 2, and figuring out that I needed to abandon that approach took me a long time.
compact wasp
mine did π
candid berry
π
tulip harbor
Is there a beginners advent of code
When I started doing AOC, I would look at everyone else's solutions if I had no idea where to begin. I started in 2020, and get a little better every year. This year, I'm asking for hints and approaches before I start looking deeply at other's solutions. If you're newer, make it your goal to try to understand the solutions of others. π
compact wasp
this is my first year doing aoc, so noted
polar sand
Going to come back to today's problem this weekend. Didn't have a lot of free time today sadly
modern terrace
this is my first year doing aoc, so noted
how many years of experience before that
compact wasp
like 4
balmy dome
can i join
frigid mural
compact wasp
can i join
become a golfer if you do
woven solar
sorry people, seaborn has spoken, we'll hit zero players by day 22, p=0.05
compact wasp
when will we hit 0 if it's linear
woven solar
looks like 20 or so
woven solar
depends on whether you weight it, I looked at the flatter tail
either way, future's looking bleak π₯΄
in AoC as well, I mean
covert arrow
what was it like before day 16?
woven solar
about the same, the model's just bad here
compact wasp
did previous years have big jumps like this?
covert arrow
makes sense tbh, the earlier problems were opened, well, earlier
during the event, maybe
but I don't see any big jumps at a glance
also, the chart on the website is linear
woven solar
on average, each day leaves 85% players still playing, this year
so with no more big jumps, we should expect around 3k players remaining by last day
muted aurora
honestly after last 2 days I've kinda lost motivation
this isn't turning out to be the "quick puzzles" I was hoping for
compact wasp
just do them faster
muted aurora
too stupid
compact wasp
π
magic oxide
too stupid
same
tepid cairn
pft, I manage lightspeed submissions π€
modern terrace
pft, I manage lightspeed submissions π€
how fast
muted aurora
i was so fast first few days
because ez
but now i have to think and brain no work π¦
day 4 prolly my peak achievement
modern harness
day 4 prolly my peak achievement
Global leaderboard is a nice achievement! I haven't managed to pull that off this year, but have a couple times in the past
muted aurora
This was my first time :^)
magic oxide
nice
torn thorn
&aoc c
shut trellisBOT
Day 17 starts <t:1671253200:R>.
viscid elbow
This was my first time :^)
that's nice, I play 3 years and get 0 score π₯²
placid lake
hello hello hello
torn thorn
hola
magic oxide
glhf
shut trellisBOT
Day 17 starts <t:1671253200:R>.
magic oxide
this is gonna be another painful day
muted aurora
im just gonna do it tomorrow so I don't stress myself with time and enjoy it
torn thorn
im gonna stay up until 2 anyways so might as well
placid lake
good luckkk
earnest forge
GLHF
muted aurora
I'm gonna be up as well but if I start now I'll want to finish fast, as opposed to if I'm already 12 hours late
shut trellisBOT
<@&518565788744024082> Good morning! Day 17 is ready to be attempted. View it online now at https://adventofcode.com/2022/day/17. Good luck!
torn thorn
omfg this is tetris isn't it
placid lake
this input looks funny
compact wasp
fucking tetris
modern terrace
is this tetris
magic oxide
actually tetris
torn thorn
lol??
muted aurora
simulate tetris lmfao
magic oxide
oh ffs they even have the 2022 number in there
muted aurora
no thanks
placid lake
lmaooo
magic oxide
like a math competition
torn thorn
lmaooo
modern terrace
just an ||itertools.cycle()||
magic oxide
doesn't seem too bad to brute force
torn thorn
yeah
magic oxide
until part 2 is like "the elephants now want you to find out how tall the tower is after 2022^2022 cycles
torn thorn
π
magic oxide
or part 2 is actually just "now the row disappears if it's filled"
hexed axle
sorry people, seaborn has spoken, we'll hit zero players by day 22, p=0.05
A bit off topic and distracting, but how did you get the confidence interval?
flat sequoia
lol part 2
modern terrace
i'm still at the base code
torn thorn
part 2 ew
pine tiger
is this ||cycle detection||?
pine tiger
until part 2 is like "the elephants now want you to find out how tall the tower ...
||man predicted the future jesus christ||
hexed axle
flat sequoia
idk what's wrong with my ||cycle detection||
this should work
but it's not working
torn thorn
||which cycles would you detect though? input doesn't seem to have repeating elements||
pine tiger
||which cycles would you detect though? input doesn't seem to have repeating ele...
||the layout of the topmost rows||
torn thorn
||the layout of the topmost rows||
||oh interesting||
torn thorn
||the layout of the topmost rows||
||but what if the piece dropped was an I piece and it goes all the way to the right, you'd need to know the entire board no?||
pine tiger
||but what if the piece dropped was an I piece and it goes all the way to the ri...
||trust||
pine tiger
????
flat sequoia
||but you also have to take into account the wind and the piece||
pine tiger
||but you also have to take into account the wind and the piece||
||yeah i did that dw||
||wait wtf even with top 100 rows it's the cycle still happens remarkably fast||
flat sequoia
well yeah
that's how it's designed
man this is so sad
i haven't leaderboarded in so long
||but you don't actually need to do all the pieces it was just easier to implement||
||you can just get the heights||
torn thorn
i am throwing so hard
torn thorn
||for cycle detection, do you just try to find like a repeating top 100 rows and just gather the rows every time you wrap back around to 0?||
||i noticed for my input it seems like every time it wrapped around to 0 the same shape always repeated||
flat sequoia
||why does it have to wrap back to 0||
||also just do the heights turns out it's way easirer||
flat sequoia
||i just thought of it right after i finished implementing getting the top 100 rows, and that worked, so i was too lazy||
earnest forge
now i'm done with both
Wtf how do you do part 2 I can't get it working
compact wasp
Wtf how do you do part 2 I can't get it working
i am legally no longer allowed to call this a skill issue
torn thorn
wow
compact wasp
basically simulated the thing ||but remembered certain shapes||
once you see something you won't need to simulate it again
torn thorn
||why does it have to wrap back to 0||
||i just noticed that the shape repeated when it wrapped back to 0||
earnest forge
basically simulated the thing ||but remembered certain shapes||
Hm hold on I think I might know actually
torn thorn
||i am throwing on the cycle finding part π ||
dim pivot
Is this good
compact wasp
better than me lol
compact wasp
i have 0
dim pivot
today was my favourite puzzle yet
i was stuck debugging part 1 for 20 mins
because i handcoded one of the rock shapes incorrectly
π¦
earnest forge
It was all right aside from my stupid typos
dim pivot
i did the l the wrong way round
earnest forge
i did the l the wrong way round
L (literally)
pine tiger
today was my favourite puzzle yet
are you a masochist
pine tiger
i thought yesterday was fine
pine tiger
have you seen 2019 day 22
pine tiger
yeah, you should check that one out
dim pivot
did you need to know some maths
pine tiger
so much math
dim pivot
what math
pine tiger
modular arithmetic
dim pivot
like do you need to know stuff like crt and flt
because i can use sympy for that
lemme try it now
devout tusk
Did you simulate the entire Tetris like game or are there any other interesting ways to do it? Only hints please
pine tiger
for p1 or p2?
devout tusk
for p1 or p2?
P1
pine tiger
oh yeah i simulated it lol
pine tiger
the one thing about yesterday
was that it required
looking @ the input
and noticing something about it
devout tusk
oh yeah i simulated it lol
But does simulating it help for p2? If not, ill not do it
pine tiger
yeah
compact wasp
yeah
devout tusk
Ah cool
Is p2 like, give solution after 20,222,022 rocks now and optimise. Or something more creative?
Just a yes or no will suffice
lunar jackal
Is p2 like, give solution after 20,222,022 rocks now and optimise. Or something ...
yes
it's give how many after 1 trillion rock drops
devout tusk
it's give how many after 1 trillion rock drops
Ah, so I'll optimise the falls then. Thanks π
torn thorn
yesterday was my favorite so far
.
naive stone
ugh, these elephants are rude
livid gull
wow thats a lot of people from one company in the top 100
devout tusk
wow thats a lot of people from one company in the top 100
oh which one?
magic oxide
wow thats a lot of people from one company in the top 100
maybe they just play a lot of tetris at that company
dim pivot
it's p2 bw
it took me around 25 mins
but i guess i do olympiad number theory a lot
so
i knew what to do
i did google code for the ||inverse|| but thats allowed in the actual aoc
the only hard thing was finding the ||geometric progression|| but ||wolfram alpha|| is a lifesaver
tropic stone
how do you draw the table ?
devout tusk
it took me around 25 mins
for d17 p2? that's SLOOOOWWWW
devout tusk
2019 day 22 p2
ohh mb lol
devout tusk
today it took me 1 hour lol
wait, what? 1hr runtime
huhh
mine was like 160ms. wot- π
woven solar
A bit off topic and distracting, but how did you get the confidence interval?
This is seaborn.regplot - it constructs the CI by bootstrapping by default I believe.
pine tiger
it took me around 25 mins
damn that one took me literal days to figure out
muted aurora
I think I'm done with AoC this year I really don't feel like simulating Tetris just sounds annoying
mossy basin
kinda felt the same way, but w/e
past comet
I suspect I will need to be clever for day 16
woven solar
day16 is definitely the hardest so far, 60% of day15 solvers didn't solve day16
day17 is actually second hardest by that metric, at 40%, but that might drop a little as stragglers solve it. second hardest so far does sound about right for it though.
low condor
Hey there. Looking for hints on 2022 Day 16 P1. Have opened a help channel here: #1053756481696170044 message . Anyone who can provide hints are much appreciated :)
honest nacelle
Man I really wanna stick with it but I'm literally getting headaches trying to figure this stuff out
torn thorn
rip
honest nacelle
So far for Day 16 part 1, I've got ||a graph and dijkstra's algorithm calculated for the distance of every node to every other node||
I think this essentially gives me ||a complete, weighted, non-directional graph since I can map every node to every other node|| but I'm not sure if that's how this works
What I can't figure out is ||how to calculate the tradeoff between opening a valve and traveling. Multiplying the distance by the flow lost traveling doesn't seem to do it||
I have gotten the example answer by both ||brute force testing each permutation and and a genetic algorithm||, but of course those are too inefficient to deal with the full input, let alone whatever they throw at me in part 2
Could I get a small hint here? Does it have something to do with ||limits||?
torn thorn
||you can do a naive solution with dp for pt 1 iirc||
honest nacelle
||I'm not terribly familiar with dynamic programming, does this basically mean to store the calculations of a subset of traveling between nodes as we go?|| I've not got the faintest on how to do that, might lose tomorrow to thinking
modern terrace
day 17 visualization (spoiler)
honest nacelle
So I revisited my ||genetic algorithm|| with a vastly simplified ||graph|| and it actually got the right answer almost right away
hidden musk
day 17 visualization (spoiler)
now do ||1e12|| π
little igloo
e
covert arrow
GLHF
earnest forge
||I'm not terribly familiar with dynamic programming, does this basically mean t...
The basic idea of ||dynamic programming|| is ||to solve a problem by reducing it into a simpler problem you've already solved||, so for day 17 you can apply that by ||building a table of possible states at each amount of time|| - ||for every minute from 0 to 30, track which gates are open and the current position, and the maximum score achieved when getting there||
Saying more than that would basically result in outright telling you the answer, but that should be enough for you to figure it out, broken into spoilers where appropriate
naive stone
&aoc c
shut trellisBOT
Day 18 starts <t:1671339600:R>.
compact wasp
time to die
torn thorn
oh shit
compact wasp
gonna choke so bad
shut trellisBOT
<@&518565788744024082> Good morning! Day 18 is ready to be attempted. View it online now at https://adventofcode.com/2022/day/18. Good luck!
torn thorn
omg
placid lake
good night
compact wasp
rank 38 holy shit
torn thorn
my code fucked up
bruh
25s
kms
i accidently typed ||(1, -1, 0)|| instead of ||(0, -1, 0)||
muted aurora
day 17 visualization (spoiler)
is it really a spoiler if it's obviously what the question is asking?
stable shale
Not doing this one at midnight. I need my sleep...
compact wasp
part 2 is⦠i need time to think
would be a lot easier if i knew this thing were convex
lunar jackal
i accidently typed ||(1, -1, 0)|| instead of ||(0, -1, 0)||
copy paste error? Me too π
hexed axle
pine tiger
torn thorn
bruh
pine tiger
well
torn thorn
am i having a reading diff
naive stone
i'm confused by part 2, i don't understand what it's asking
earnest forge
Stupid logic errors caused by writing code at 5AM :D
earnest forge
I AM SO DUMB
YES SAME
earnest forge
i copy / paste diff again
What?
torn thorn
supposed to be like this rigth?
||for i in ((1, 0, 0), (-1, 0, 0), (0, 1, 0), (0, -1, 0), (0, 0, 1), (0, 0, -1)):||
i had
||for i in ((1, 0, 0), (-1, 0, 0), (0, 1, 0), (0, -1, 0), (0, 0, 1), (0, 0, 1)):||
earnest forge
LMAO NO
torn thorn
kms
earnest forge
||code's to get sibling cubes||
No I know but I saw what was coming
torn thorn
lmao
torn thorn
||THE HTING WAS, IT DIDNT MATTER FOR PART 1 CAUSE ????||
compact wasp
actual diff
covert arrow
Can we assume ||there's only 1 air pocket?||
earnest forge
||THE HTING WAS, IT DIDNT MATTER FOR PART 1 CAUSE ????||
Lmao got lucky
earnest forge
Can we assume ||there's only 1 air pocket?||
No idea, I didn't
torn thorn
Lmao got lucky
i had the SAME bug for part 1
||it was just a different coordinate||
π
torn thorn
Can we assume ||there's only 1 air pocket?||
don't
pine tiger
i'm confused by part 2, i don't understand what it's asking
the stuff that's actually outside
covert arrow
alr
naive stone
the stuff that's actually outside
right ok, so our scan included cubes that were entirely surrounded by other cubes?
pine tiger
yeah
naive stone
ah ok
earnest forge
Can we assume ||there's only 1 air pocket?||
Yeah ok definitely no
covert arrow
I thought so
earnest forge
I found 32, if you were wondering
Here's a ||list of sizes||:
||[991, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]||
naive stone
oh but it's surrounded by air, and then surrounded by other cubes, i see. damn
i have no idea how to solve this
lol
earnest forge
i have no idea how to solve this
I struggled for a while because I failed to consider ||pockets of a size greater than 1|| LMAO
pine tiger
||if it's outside, you can BFS to the border||
naive stone
||if it's outside, you can BFS to the border||
||but what if there's air between two cubes on one side making it look like it's surrounded, but another side is completely exposed to air? I have to check every side of the cube but if there's nothing stopping me i go to infinity||
||i guess i can stop at the max x, y, and z coords from my scan||
pine tiger
||but what if there's air between two cubes on one side making it look like it's...
||if you go to infinity, that side is valid area||
pine tiger
||i guess i can stop at the max x, y, and z coords from my scan||
||yeah, the max coords aren't too big||
naive stone
word word
flat sequoia
the coords are really small yeah
torn thorn
fun
torn thorn
are you sure you're checking if you've visted a square
devout tusk
||so, these are all the point sized cubes. what exactly needs to be done? i don't quite understand. do they need area of some connected 3d polygon?||
magic oxide
no
torn thorn
||so, these are all the point sized cubes. what exactly needs to be done? i don'...
||think minecraft||
torn thorn
||it's literally just minecraft||
torn thorn
lmao
magic oxide
and count with spectator mode
magic oxide
why tf is my bfs stupid
devout tusk
never played it π€
magic oxide
am I that incompetent I can't even write a correct bfs
torn thorn
||do a floodfill||
torn thorn
||don't try to go for sides, coordinates are small enough||
||are you checking your bounds correctly||
torn thorn
||I just have 0<=x<=20 for all the coords||
||i don't think that'll cut it||
magic oxide
||my max coordinate seems to be twenty tho||
devout tusk
||my max coordinate seems to be twenty tho||
||max is 20 for everyone. already verified for golf lol||
lunar jackal
||max is 20 for everyone. already verified for golf lol||
not for me
naive stone
he purposely makes puzzles on the weekend a little easier to give people a break
torn thorn
i thought it was the other way around .-.
people have more time to actually do the problem
naive stone
i did too actually, in the post where he mentions it, it's kinda ambiguous
who really knows what eric is thinking
torn thorn
π€·ββοΈ
devout tusk
||think minecraft||
i still don't think I understood the question :/
Can someone explain graphically?
torn thorn
part 1 or part 2
@devout tusk
||assuming # is a solid and . is air, and we are on a 2d surface||
keen crystal
torn thorn
||part 1: each arrow is pointing to an exposed surface, count the amount of arrows||
torn thorn
π
keen crystal
hi
torn thorn
i still don't think I understood the question :/
Can someone explain graphically...
part 2: ||you can't count the arrows circled in blue because it's not exposed to the "outside"||
woven solar
load the points in
that sounds hilarious actually, let's see how easy it is to programmatically generate minecraft maps...
torn thorn
lmao
torn thorn
that sounds hilarious actually, let's see how easy it is to programmatically gen...
||generate a /setblock x y z for every position x y z and run it as a datapack||
naive stone
people have already used minecraft for visualizations of at least one of the previous puzzles. So I'm willing to bet we'll see more for today's
devout tusk
part 1 or part 2
p1
devout tusk
||part 1: each arrow is pointing to an exposed surface, count the amount of arro...
||but what if it is disconnected? won't all 6 sides be exposed?
or is that not possible in the given input?||
woven solar
||it is possible, yes, then that single-cube-droplet has a surface area of 6||
devout tusk
||part 1: each arrow is pointing to an exposed surface, count the amount of arro...
||isn't that just 6-(if there are any neighbors in the points array as well) for every point?||
||that's just stupidly easy to be true||
torn thorn
||isn't that just 6-(if there are any neighbors in the points array as well) for...
today is really easy
torn thorn
yeah
compact wasp
||isn't that just 6-(if there are any neighbors in the points array as well) for...
this is exactly how i did it
magic oxide
I just did ||+1 if not in set else -1 for every 6 directions of each block||
covert arrow
people have numbers >21?
torn thorn
yeah
devout tusk
||Is p2 convex hull or am I over thinking it?|| @torn thorn@covert arrow
modern harness
From the creator of AOC:
All of the puzzles are designed to have a solution that completes within 15 seconds on pretty old hardware in an interpreted language. (Call it ~250ms in a compiled language.)
Is it reasonable to have an expectation of 60x faster for compiled languages?
covert arrow
||Is p2 convex hull or am I over thinking it?|| <@912708332916195368><@726368249...
what is ||convex hull|| lmao
Yeah it seems similar actually no they're different
but you won't need it
placid lake
how was todayβs problem
i glanced over it last night and it didnβt seem too bad
when i said iβd go to sleep instead of doing AoC for more sleep but
magic oxide
significantly easier compared to last 2 days
mossy basin
will look at it soon
restive imp
I hate algorithms. Just like last year it's dijkstra that makes me lose my motivation
cyan sleet
||Is p2 convex hull or am I over thinking it?|| <@912708332916195368><@726368249...
it's not convex hull
devout tusk
it's not convex hull
too late, lol. Already did it like 8 hours ago lol
cyan sleet
there is no guarantee the shape you're trying to find the surface area of is convex
past comet
:sigh: I need more test inputs for day 16
I'm calculating something wrong somehow on the larger input because I pass the initial test, but past a certain branching factor all my searches return the same wrong answer
compact wasp
alas
past comet
huh, I had a bug in my time keeping for each player that wasn't breaking the test cases but was in the full scale
past comet
does the guess duration get longer than 5 minutes if you keep getting things wrong?
faint thicket
hey can anyone help me with day 7 im super duper stuck
a dm or even a quick call just to get myself situated because I cant seem to get anything down
torn thorn
hey can anyone help me with day 7 im super duper stuck
common problem: ||are you assuming directory names are unique?||
faint thicket
common problem: ||are you assuming directory names are unique?||
not even Im just stuck creating a directory tree Idk how I should go about making one
low condor
not even Im just stuck creating a directory tree Idk how I should go about makin...
still looking for help?
sharp panther
!cban 989273658570711181 racism
marsh currentBOT
:incoming_envelope: :ok_hand: applied ban to @narrow hull permanently.
torn thorn
byee
magic oxide
what was last year 19?
covert arrow
beacons
the one where you had to rotate the scanner scans and match them up with beacon positions
rancid creek
doesn't feel like day 19 was that bad, I enjoyed beacons.
magic oxide
beacons was mainly just brute force wasn't it?
just rotate everything 27 times and check every beacon for every scanner
rancid creek
day 23 and day 24 last year were both objectively harder. although day23 was good for me, it was on average a lot harder.
magic oxide
amphipods was such a simple problem and input
but devilishly annoying to solve if you didn't know algs or anything
think I ended up asking a comp sci professor friend of mine for help with an algorithm and he told me about uniform cost search
day 24 was just math
disguised as an instruction problem
rancid creek
day 24 was just math
difiiculty scatterplot using the top 100 finish tmes:
https://www.maurits.vdschee.nl/scatterplot/
really cool
modern terrace
doesn't feel like day 19 was that bad, I enjoyed beacons.
i mean it took at least 40 minutes for 1st place to solve it
magic oxide
difiiculty scatterplot using the top 100 finish tmes:
https://www.maurits.vdsche...
seems to be a valley between two peaks situation the past couple years
think we're in the lull rn
so hopefully a less difficult problem today
and then difficulty ramps up again the next couple days
or of course the peaks are actually duplicating over the years and we get three peaks this year
earnest forge
GLHF everyone
Hopefully today won't be too long so I can get more sleep before my exam later kekw
My VSCode integrated terminal has kicked it, so always-on-top windows it is I guess π
covert arrow
GLHF
shut trellisBOT
<@&518565788744024082> Good morning! Day 19 is ready to be attempted. View it online now at https://adventofcode.com/2022/day/19. Good luck!
magic oxide
tech tree is ore -> clay -> obsidian
torn thorn
wow
magic oxide
i assume part 2 would be like ||now u can switch blueprints||
magic oxide
tfw you have to reformat the example input
torn thorn
probably...?
i doubt you'd ever want to thoug
||interesting how ore is collected only at the end of the day||
raven wave
im not having a good time
torn thorn
||interesting how ore is collected only at the end of the day||
don't reading diff ^
lunar jackal
I can't tell if it's a greedy algorithm or a dp problem
magic oxide
so you get the ores after the minute ends?
earnest forge
I can't figure out applying either of those lol
lunar jackal
I'm sure the || obsidian to geode || is greedy
devout tusk
ew what is this
Looks boring and tedious to implement ngl. I don't have the motivation to do this especially on a Monday morning
pine tiger
I'm sure the || obsidian to geode || is greedy
if that's the case it's probably the same with all the others since the general formula is the same
lunar jackal
screw it, dp it is
lunar jackal
|| treat it like a graph ||
woven solar
~~how do we apply dp to this though~~
50%|βββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ | 1/2 [01:38<01:38, 98.94s/it]
very slowly
pine tiger
is this actual input
woven solar
nope, test
pine tiger
lmao
devout tusk
|| treat it like a graph ||
Eww, ||not another graph question again! ||
They should allow a user rating for every question so more questions can be made that are interesting rather than tedious like these
modern terrace
wtf i forgot
earnest forge
50%|ββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ...
kekw
torn thorn
if that's the case it's probably the same with all the others since the general ...
||ok but sometimes clay robot costs more, sometimes clay robot costs less - any way to prove that greedy will work?||
pine tiger
||ok but sometimes clay robot costs more, sometimes clay robot costs less - any ...
||at this point it probably won't||
torn thorn
||just hail mary and hope then?||
dim pivot
i have no idea how tf to do this
modern terrace
They should allow a user rating for every question so more questions can be made...
that's the entire point of the latter days? more tedious?
modern terrace
i have no idea how tf to do this
you're not the only one
torn thorn
that's the entire point of the latter days? more tedious?
tedious != hard
tedious is just annoying
dim pivot
the dp does not work
raven wave
tedious != hard
this
it makes sense its just
a lot to account for or do by yourself
torn thorn
latter days should be hard not tedious
woven solar
oh hey, test works
raven wave
both work for me im just bored
torn thorn
wow
pine tiger
torn thorn
oh hey, test works
how long did it take for you again?
woven solar
03:32 to check the test
pine tiger
bruh this has been running for so long
torn thorn
03:32 to check the test
that's uh... 2 test cases
pine tiger
03:32 to check the test
are you testing building every robot/no robot for each state?
woven solar
weirdly enough, the actual input seems to go faster
tqdm predicts 4 minutes, but I'm sceptical
torn thorn
uhoh
woven solar
are you testing building every robot/no robot for each state?
|| yes. well, every kind I can build. except for geodebots which i handle slightly smarter. ||
magic oxide
ok note to self don't set recursion limit to 999999999
compact wasp
and you account for being able to build multiple?
magic oxide
my python just crashed
woven solar
oh yikes, updated prediciton
| 4/30 [02:02<18:26, 42.56s/it]
modern harness
and you account for being able to build multiple?
Can you?
woven solar
the text of the tast actually seems unclear on that
compact wasp
wasn't reading carefully
woven solar
but I assume the fact we have only one factory is supposed to imply that
compact wasp
π
modern terrace
latter days should be *hard* not tedious
i feel like this is challenging me though
compact wasp
wasn't reading, was about to do something much more tedious than needed
modern terrace
i feel like this is challenging me though
how is that also not hard