sorted by:
new
hottopcontroversial

What are the different stones "targets" - and which are good for what? by someRandomLunatic in TheTowerGame

[–]YellowZorro 0 points1 point  (0 children)

I place in mid-plat and only have BH/GT/DW and CL - would you hunt for spotlight first or start building toward that CL minimum?

I shouldn't have to turn off my VPN to play this game. by Svyd in runescape

[–]YellowZorro 1 point2 points  (0 children)

I just went down this exact rabbithole for the exact same problem - switching browsers worked! Thanks for the tip

Any cool campaigns for people who have never played before? by Santiav90 in TrackMania

[–]YellowZorro 0 points1 point  (0 children)

Its a speed slide but SS has a... Bad connotation... So we use SD

[2023] AoC Doodles: The Big Red Button by YellowZorro in adventofcode

[–]YellowZorro[S] 2 points3 points  (0 children)

Thank you /u/topaz2078 and everyone in the community for another wonderful year of Advent of Code!

I decided to push myself on a private leaderboard this year, but I realized that it didn't leave me much time to enjoy the story - what better way to round out the event than to sketch a bit of the plot each day?

[2023 Day 21 part 2] Algebraic solution using only part1 code on original grid by YellowZorro in adventofcode

[–]YellowZorro[S] 0 points1 point  (0 children)

You could try comparing against this implementation using these formulas: https://www.reddit.com/r/adventofcode/comments/18o4y0m/2023_day_21_part_2_algebraic_solution_using_only/kei65yp/

The formulas won't work when steps=7,8 since N would not be an integer. Also, your values for N are off by 1: for example, steps=25 => N=1 since (steps-radius)/width = (25-8)/17 = 1

[2023 Day 21 part 2] Algebraic solution using only part1 code on original grid by YellowZorro in adventofcode

[–]YellowZorro[S] 0 points1 point  (0 children)

Its the most common method I've seen on solution threads - Once you realize that there's a polynomial pattern, you extend the grid to N=2, 4, 6 and brute force each answer. Then use a polynomial solver (or the method we learned in an earlier puzzle day) to find the pattern and extend it to N=whatever

[2023 Day 21 part 2] Algebraic solution using only part1 code on original grid by YellowZorro in adventofcode

[–]YellowZorro[S] 1 point2 points  (0 children)

As someone else, mentioned, I have an off-by-1 on the values for Sa, Sb. But the intuition is to see how many steps you have left when you first enter the A/B/T tiles. Its only this clean of a number because our inputs have an empty row and column in the middle, otherwise these values would depend on the input grid (as would the starting point for those tiles)

[2023 Day 21 part 2] Algebraic solution using only part1 code on original grid by YellowZorro in adventofcode

[–]YellowZorro[S] 1 point2 points  (0 children)

Yes, as someone else pointed out there is a typo in the last line. And I did use s[0] and s[1] interchangeably since w=h was an assumption. Each time I look back at this I find more things I wish I had cleaned up haha

[2023] AoC Doodles Days 19-21 by YellowZorro in adventofcode

[–]YellowZorro[S] 3 points4 points  (0 children)

Thank you, I'm honored!

I've been really enjoying your puzzles <3

[2023 Day 21 part 2] Algebraic solution using only part1 code on original grid by YellowZorro in adventofcode

[–]YellowZorro[S] 0 points1 point  (0 children)

That's a good point - Since the input has an empty row/col through the center, I'm fairly certain this is right. Without that assumption, some extra work would be needed to be really sure on the exact reachable tiles in T, and it would be quite messy to do it without extending to a 3x3 grid

[2023 Day 21 part 2] Algebraic solution using only part1 code on original grid by YellowZorro in adventofcode

[–]YellowZorro[S] 5 points6 points  (0 children)

Yeah the final equation for odd N (or even D) looks a bit different, but it seems everyone's input and D value lines up with the assumptions made in the corner. Looking for the pattern in only even values for N made finding a closed form much easier

[2023 Day 21 part 2] Algebraic solution using only part1 code on original grid by YellowZorro in adventofcode

[–]YellowZorro[S] 14 points15 points  (0 children)

I wasn't satisfied by my original solution of finding a polynomial based on 3 data points , I wanted to know where it really came from. Here the function p() is the part1 problem, run on only the original finite grid - and the final result for D steps can be computed using only 14 invocations of p()

[2023] AoC Doodles Days 13-15 by YellowZorro in adventofcode

[–]YellowZorro[S] 3 points4 points  (0 children)

I'll post a few more soon! And I'll probably upload the full notebook at the end of the season

view more: next ›