- Видео 106
- Просмотров 58 248
p88h.
Польша
Добавлен 27 янв 2008
Various Videos Visualising Very Vital Values
Locks and Keys
Advent of Code 2024, Day 25
Visual matcher - shows _all_ key / lock combinations being checked and all found correct matches.
Visual matcher - shows _all_ key / lock combinations being checked and all found correct matches.
Просмотров: 170
Видео
Logic State Analyzer NG
Просмотров 34321 день назад
Advent of Code 2024, Day 24 There probably isn't a very good method to solve this in general, so I did a toy network editor. Layout is automatic based on the connections and it's obvious what the overall structure _should_ be, though some node swaps (last one) may be a bit tricky to see. The simulator is actually interactive - allows to run individual lines in input, see what changes, and swap ...
Network Effects
Просмотров 18521 день назад
Advent of Code 2024, Day 23 Solves the problem* via physics simulation: * Start with fully random node positions. * Connected note s attract each other with force F (up to their 'perimeter') * Non-connected nodes that are close by repel each other with force F/4 (up to some distance X). This force is additionally amplified at low distances (below node 'perimeter') Network self-organizes itself ...
Multi Multi Player
Просмотров 1 тыс.21 день назад
Advent of Code 2024, Day 23 Attempts to construct all the possible cliques (of size 3 or more). Uses the provided connections to expand to their common interconnected nodes, and validates those are fully connected. Since this happens greedily, a more optimal solution can potentially exist, so it's just an approximation; but it does find the largest clique / solution along the way.
Banana Grading
Просмотров 7221 день назад
Advent of Code 2024, Day 22 Visualises all the patterns for all the monkeys. Each row represents a sequence of _patterns_ for one monkey. Each pixel is determined by the pattern (hue / low rgb bits) and number of bananas (intensity / higher bits of rgb). Black pixels indicate repeated patterns for a single seller.
Dynamic Trees
Просмотров 30821 день назад
Advent of Code 2024, Day 21 Shows the progression of dynamic programming / recursive memoization solution for the problem. The program builds a table that allows to answer generic question of 'how many button presses are needed to achieve a sequence X=key via D=depth robots'. Since each sequence in the cache ends with 'A' press, this answer is always independent of previously entered sequences ...
Short Cuts
Просмотров 36621 день назад
Advent of Code 2024, Day 20 Displays all the shortcuts / cheats available for every point on the racetrack. Racetrack happens to be a single twisting line, the code searches backwards through that list. The path from the start is highlighted in gray, and the path to the end is highlighted in blue (this changes dynamically)
Towel Space Decomposition
Просмотров 20028 дней назад
Advent of Code 2024, Day 19 Attempts to visualise the problem of lining up all possible towel variants against each pattern. Towels are only added at valid positions, though the simulation does not 'cancel' ones that do not have a valid continuation (this reflects how the dynamic programming solution works, we only care about positive results)
Speed Limits
Просмотров 1,7 тыс.28 дней назад
Advent of Code 2024, Day 18 Finds the minimum path at each possible time point (solving both part 1 and 2 on the way) plus determines _actual_ minimum speed the historians need to achieve in order to pass safely to the other side.
Codebreaker
Просмотров 241Месяц назад
Advent of Code 2024, Day 17 Shows a simple 'debug output' for all considered key iterations. The process generates consecutive digits of input (base 8) and evaluates if they match the program.
There an Back Again
Просмотров 294Месяц назад
Advent of Code 2024, Day 16 In first phase, we look for shortest path in rough order of distance (Dijkstra-ish). This highlights nodes in white. In the second phase, we go back, looking for nodes that have backward_cost forward_cost equal to the total minimum - this highlights nodes in yellow, and marks the nodes that are considered, but have wrong cost as red.
Robot is Push
Просмотров 359Месяц назад
Advent of Code 2024, Day 15 (part 2) I made a semi-interactive toy to run around with the robot and push bricks. It uses Sokoban tiles for walls and boxes, re-scaled and fixed up manually. Robot image from opengameart.org/content/pixel-robot
Egge Detector
Просмотров 184Месяц назад
Advent of Code 2024, Day 14 Displays the robot locations at time steps from 0 to 10000. For each frame, this uses a simple edge detection logic to score the layout. Higher scoring frames are tinted towards green, making it easy to spot eggs. Or trees.
Distance Plots
Просмотров 212Месяц назад
Advent of Code 2024, Day 13 Probably would not make for a very efficient solution : plots the distance from goal over a range of A and B values, and looks for the minimum / zero value. With appropriate sampling or using gradient descent rather than simple all-value probing, it does provide a betrer approach to part 2 than a simple naive simulation. (The actual solution would use a linear solver...
Garden Fences
Просмотров 184Месяц назад
Advent of Code 2024, Day 12 Tried to make a 3D visualisation of the garden with actual fences. Probably could use some better camera work...
hello :)
ruclips.net/user/shortsoAWJLoBlmuU - part 2 without any path finding
yeah, tested that approach as well. Visually interesting, but slower than backwards BFS.
@ really? I’d say union-find on preallocated array is as fast as possible, most def faster than bfs, but maybe I don’t see something here…
@@jakubgwozdz2780 BFS is O(N), and in this particular case, N~=length of the last path before its blocked, i.e. around 500. Sure it also needs to check a bunch of removed blocks (~1000) but mostly doesn't need to do anything about them. With UF you either join all the available spaces and go backwards, processing ~3000 union operations (free blocks at the end+removed blocks until start and end are joined), or join blocks and go forward, also processing around ~3000 unions until the corner sets are joined. Even if UF was O(1) it would stil lbe slower here, and with that extra log* it's much slower.
@@jakubgwozdz2780 in practical terms, my part1 takes ~14 us (single BFS but with still lots of points available), and part2 BFS takes ~4 us.
If you're doing it in Zig this year, is the old python viz library you posted about on reddit being adapted to Zig? Or have you tried new viz techniques?
@@plusplusplus9837 I'm using raylib this time - the utility classes around it are written similarly to what I used for Pygame, but specifics are a bit different. It's close to what I used two years ago for C#
Very nice. What did you use for visualisation?
Raylib -- source is here: github.com/p88h/aoc2024/blob/main/vis/vis12.zig
Beautiful! 💯
super duper cool -- perhaps my fave visualization of aoc2023
certified moment
What
Blue. No. White. What a video
what tool are you using to visualize this?
PyGame. Sources here: github.com/p88h/aoc2023/blob/main/vis/day08.py
@@p88h. thanks
very noice
super cool!
It's an algorithm showing me the algorithm to find all areas of a maze!
thanks algorithm
thank you RUclips algorithm, very satisfying
TheoTown?
Is this an arg?
no read the description
it is. do not believe the description. they are lying to you
@@bananozavr i concur
Ah my @ didnt work, oh well
Yeah sure. Everything is an ARG. You are being lied to! OooOOoooOOoooooOoo
Mirrors? Cool
RUclips really thought this was a Christmas video and started recommending it. On another note, this was interesting. What’s the full context?
adventofcode.com/2023/day/19 Well it is Christmas related, somewhat.
I don’t understand what I just watched, but it’s beautiful
yeah really cool
yeah really cool
Yeah really cool
Yeah really cool
yeah really cool
I did something very similar: ruclips.net/video/yMYJRpM2UWI/видео.html
From Advent of Code?
Yup
For some reason my brain is playing flight of the bumble bees
and now all of us too 🐝
cool
literal llm weights
Platonic? More like “Fantastic!” 👍
What is this?
Baited
One day RUclips algorithm will send this video to millions of people who opens expecting Daft Punk
Не видел ещё таких условий, обычно у всех статичная основа. Это интересно
oh, that's how you've done it
does the unit turn to the right when touching an obstacle?
It follows an input sequence, which needs to be adjusted when hitting obstacles. See adventofcode.com/2022/day/22 for rules of this task.
@@p88h. great thanks for you for popularising this programming! I wouldn't know anything about it without your videos
Is it polish notation, like (+ 1 2) instead of 1+2?
Similar, but really it's just stack-based notation - numbers get pushed on the stack, operations pull last two numbers from the stack and push the result. Any AST can be represented this way, similar to RPN, but notation-wise, it's like reversed-RPN.
WHERE SONG
What is this?
I expected Daft Punk, lol
Well I can't just like add it here, unfortunately ... But plays 'along' really well ;P
Что это?
How about code?)
github.com/p88h/aoc2022/blob/main/vis/vis22.cs
@@p88h. thx
Wow, that's looks cool
Personally, a favourite Christmas activity of mine.
Me watching that boulder flush steam like 👁️👁️
I am here and confused
me and the boys at the sleepover 🤠
Is this the example from part 1 ?
Yes, this is the full sample input.
holy crap this is such a cool way to visualize this
POV: You are a helicopter
I don’t know what I just watched but cool
Tree
Where?
love it
So neat! What are the rules they follow?
The basic rules are the green ones move right, and the red ones move down - unless they are blocked. The full explanation is here: adventofcode.com/2021/day/25