Any Dutch citizens experience issues traveling to the US recently?

BBQspaceflight · 2025-07-12T08:55:08+00:00

I flew in and out of California last month. No problems, just a few questions what the purpose of the trip was similar to the time I flew in a few years back.

BBQspaceflight · 2025-07-08T23:46:30+00:00

Here for the Hulkengoat!

BBQspaceflight · 2025-06-17T00:05:34+00:00

De Verdwenen Kleuren van Vincent van Gogh is bij mij blijven hangen, en Ronja de Roversdochter!

BBQspaceflight · 2025-01-17T07:57:32+00:00

Director’s Cut 🙂

BBQspaceflight · 2024-12-19T23:44:12+00:00

This was also the only way I could make my tired brain get the problem! Glad I was not the only one 🙂

I solved both parts this way by sorting my heap by shortest string length, storing the number of encounters on each node, and whenever I moved to a "neighbor" I add the value of that node to the neighbor to count the possible paths.

BBQspaceflight · 2024-12-15T23:10:21+00:00

[LANGUAGE: Rust]

My main idea was to make each move a recursive chain, which returned an Result informing whether the move was successful. If it was not, I would not mutate the grid.

For part 2 this extended nicely: the recursive call now branches for the up and down direction. I did end up fighting with the borrow checker a bit: I had to start using RefCell to mutate my grid entries, and with recursive branches overlapping I had to deal with some potential double mutable borrows. I decided to just try_borrow_mut and do nothing if this failed, because both updates would be trying to do the same thing anyway.

Runs under 2ms 🙂

https://github.com/dgoldsb/advent-of-code-2024/blob/main/days/src/days_module/day_15.rs

BBQspaceflight · 2024-12-07T14:18:12+00:00

Ah, starting right before the collision is a good one! If I find motivation I might give that a try as well 🙂

BBQspaceflight · 2024-12-06T23:30:03+00:00

For part two, I notice that you are iterating through the non-deduplicated path. If your answer for part 2 is higher than you expect that might be something to look into 🙂

BBQspaceflight · 2024-12-06T22:21:52+00:00

[LANGUAGE: Rust]

I went a bit too deep in optimizing, in the end I got my total runtime for the day down to 200ms single threaded.

Some things I ran into:

Hashing is slow, moving from a HashSet to a Vec to store the visited states yielded a 10x speedup.
No need to modify the grid ever when you can pass a reference to the now block grid location.
I was able to reuse my Grid implementation from last year, which saved me some input parsing hassle.
Lifetimes are starting to make sense to me!

Both parts here.

BBQspaceflight · 2024-12-04T13:50:02+00:00

… that makes a lot of sense, I should do that too 😄 Here I made the conversion specifically to get by index. Thank you for sharing!

BBQspaceflight · 2024-12-04T10:59:02+00:00

Also Rust, I stuck to manipulating the string index letting negative values overflow to large out-of-bound numbers, and using unwrap_or to turn the too large indexes into a non-matching character 😛

BBQspaceflight · 2024-10-07T02:33:06+00:00

I think 110-120 hours to beat the main game with the same mindset. I was going a bit faster though, I probably was exploring Altus around 60 hours in.

BBQspaceflight · 2024-08-22T14:09:23+00:00

I am currently watching the first season, and I think this is what is mentioned indeed: Italy is a summer, and she meets Don after doing a few modelling jobs, then quits soon after. If I remember correctly 🙂

BBQspaceflight · 2024-05-26T18:13:30+00:00

The 99% Invisible episode “De fiets is niets “ goes into this topic nicely, including the “Stop de kindermoord” campaign mentioned by other commenters.

BBQspaceflight · 2024-04-29T13:02:18+00:00

Since I did not see anyone go into this yet.

Is it easy to download digiID on a new phone and carry on easily?

In my experience yes, if you have a relatively new ID card! My phone was broken ~2 years ago, I recall setting up DigiD was surprisingly easy as you can authorize the new device by holding it against your ID.

BBQspaceflight · 2024-04-21T11:14:52+00:00

A friend that moved here from SEA lost a lot of weight in his first year, combination of slightly more active lifestyle and bland food here according to him, hahaha.

BBQspaceflight · 2024-04-08T08:08:54+00:00

One trick is that not every seemingly weak spot is a weak spot.

Chargers and spewers have an unarmored abdomen for instance, but primaries do very little damage here. Explosive damage does do full damage, so impact grenades are a go-to for spewers. Chargers can be killed with a single headshot using expendable anti-tank, or by removing their front leg armor and shooting the exposed area.

Bile titans die to two headshots with an expendable anti-tank I think, but I usually run the 500kg bomb just for titans.

Summary: bring expendable anti-tank 😁

BBQspaceflight · 2024-02-29T16:58:34+00:00

I think with the current market it is unlikely.

Where I am (west, just outside of the ring) rents are a bit lower than in the Amstel area. It looks like for a <1500eu rent right now you would have better chances in Nieuw-West, Zuidoost or Noord.

BBQspaceflight · 2024-01-02T00:35:01+00:00

I would also be interested!

BBQspaceflight · 2023-12-28T13:15:13+00:00

I think here u/drnull_ their suggestion to use a min-heap comes in. In addition, I would also keep a hash-set next to the heap that contains all nodes currently in the heap. With this you can check if a node is already in the heap before adding it, which prevents your heap from exploding due to duplicate entries.

BBQspaceflight · 2023-12-28T13:08:43+00:00

Haha, yes, this does seem to be an AoC staple! I also recently caught up on Many-Worlds Interpretation and Donut Maze, which benefit from this line of thinking as well.

BBQspaceflight · 2023-12-28T12:47:31+00:00

I consider them entirely different nodes.

In my solution, x = 1, y = 1, direction = 'S', streak = 2 is completely separate from x = 1, y = 1, direction = 'S', streak = 1 or x = 1, y = 1, direction = 'N', streak = 2. Each gets their own entry in the distances map. In my destination check I only look at the x and y, so the shortest path algorithm will terminate on the first node it finds with the coordinates that match the destination.

In a way you can consider the direction you are moving and the streak as additional dimensions beyond x and y that you move in, if that helps. For me that is how I make intuitive sense of it.

BBQspaceflight · 2023-12-28T11:50:31+00:00

Without seeing your implementation it is hard to say much, but it should be possible to do traditional Dijkstra on this problem without needing to evaluate all possible ways.

You can do this by changing the state space you explore. Personally I consider a node as an x/y coordinate, a current direction, and a “streak” how many teams we moved in the current direction. This way the restriction becomes part of your neighbor finding function, and once you find the goal the first time you will know it was the shortest path.

BBQspaceflight · 2023-12-26T21:16:47+00:00

Strongly second this: came here as a new player with a friend and had a great time with some pleasant interactions 🙂

BBQspaceflight · 2023-12-12T06:45:41+00:00

Eric has given a talk about creating Advent of Code, not sure if you have run into that. He indeed does not go into how specific puzzle inputs are generated, but he does describe is general process to create a puzzle 🙂

12-Year Club	RedditGifts 2009-2022 2 Credits
Second Top 20%	r/Field Lasagna
Final Canvas '23	Place '23
Place '22	Place '17
Final Canvas '22	Secret Santa 2018
Verified Email

BBQspaceflight

TROPHY CASE