The Bridge

« first day (4533 days earlier) ← previous day next day → last day (802 days later) »

Unionhawk

02:08

Desert Treasure II - The Fallen Empire - Cinematic Trailer

►

Finally grandmaster Mahjarrat

6 hours later…

Lazers 2.0

08:00

Q: What determines whether I can see a Pokémon's size records in the Pokedex?

Pokémon GO recently added a feature that lets you see whether a Pokémon is the tallest, shortest, heaviest, or lightest that you've caught of that particular species. The records are also available in that species' Pokedex entry, but I can only see them for certain Pokémon, and there doesn't seem...

pokemon-go

3 hours later…

MBraedley

10:56

That has to be the most benign version of Dykstra+BFS I've ever seen in an AoC

Although my solution technically isn't Dykstra since I'm just using a basic queue instead of a priority queue.

Although the queue should naturally be sorted since it's a constant node distance.

2 hours later…

murgatroid99

12:57

I'm pretty sure Dijkstra's algorithm is only interesting on a weighted graph. If all weights are equal, it's just BFS

MBraedley

Yes, it reduces to plain BFS.

3 hours later…

SaintWacko

15:36

I'm just now working on day 10, and I'm very confused

Following the instructions given doesn't seem to generate the correct output

Nevermind

Because of the way I was tracking it, I had to start my cycles at 0

Ronan

@SaintWacko I think I changed what value cycles started at about 5 times for that one. It kept being simpler to have the one value, and then the next time it needed to use it the other was better

SaintWacko

Aw, man

for part 2 I actually have to track each cycle

Not just when it changes

MBraedley

16:00

@SaintWacko I mean, I was doing that from the beginning

2 days ago, by MBraedley

Also, the during vs after bit messed me up on part 1. I ended up being off by 1 for just the last value, so I thought it was correct.

SaintWacko

16:20

@MBraedley I was going by instructions, incrementing cycle by 2 for addx, and checking in such a way that I got the value before the instruction finished executing

murgatroid99

I started out trying to do that, but I found it simpler just to do the check every cycle

MBraedley

I figured knowing what the value would be after each cycle would be important

SaintWacko

16:37

@murgatroid99 I didn't feel like putting in a flag to skip a cycle for addx

Actually, for part 2 I still didn't do that...

I just had it insert a blank instruction before each addx when it processes the input :D

Course, I'm getting my own issue where it only prints the first line...

Oh, I missed a modulo

murgatroid99

@SaintWacko I didn't have a flag or anything, I just broke it up all the way: increment the cycle once, then do the check, then increment the cycle again, then do the check, then actually change the value of X.

SaintWacko

@murgatroid99 Ah, I see

I had been thinking of doing it where if it was an addx instruction it set a flag, then on the next loop checked if the flag was set and if so, changed the register and unset the flag

github.com/SaintWacko/aoc2022/tree/main/Day10

Unionhawk

17:05

@Unionhawk Oh shit and there's another master level Mahjarrat in polls now as a Devious Minds, Fight Arena, and Hazeel Cult sequel

finally, the cool sword bow from devious minds returns

murgatroid99

@Unionhawk Where did you see that?

Unionhawk

That's winter summit stuff

Also the sword bow is absolutely not back

But maybe

Arcane did say devious minds

The 2022 Old School Winter Summit!

►

About 1 hour

Also I guess it's not in poll now, the current poll is "should we start developing a new skill subject to the new polling agreement"

They very much do not want it to be Warding 2, which failed by I think 5% or something

MBraedley

18:09

@SaintWacko @Unionhawk I really need you to finish today's AoC so that @Wipqozn doesn't pass me again.

Oh wait, the best he can do is 1 point behind me for today.

SaintWacko

@MBraedley I'm a few days behind, might not get to today's until tomorrow

MBraedley

You don't need to do them in order :P

SaintWacko

@MBraedley Eh, true

Wipqozn

18:55

4) 258 ************ MBraedley
5) 257 ************ Bryan Cave

@MBraedley :(

Got started really late today

Also, I ended up just making a generic Graph/Node class and stuck it in a Utils folder

Figure I might as well start creating these reusable util functions where possible

and Node has a property obj, which can be anything. Basically just a lazy way of allowing me to extend Node with solution specific data... basically a generic from C#.

So right now it 's got a BFS function, along with two functions for finding shortest paths on an unweighted graph (Aka one find it between some node Root and some node Goal, and another loops through alist of possible Start nodes finding the shortest).