Visualizing Pathfinding Algorithms 

8:24, your algorithm just straight up played Flight of the Bumblebee

The sound effect turned up much cooler than I expected tbh. Great work here!

What I think would be cool if the path was not generated instantly, but was constructed tile by tile with the noise. Just like the algorithms

I love how you showed “mistakes”. That’s so useful for learning. Maybe you even made mistakes on purpose to be pedagogical, I don’t know. Very useful regardless!

You should have written which is which. Btw a lot of other algorithms exist: like there are various speedups for A* for grid-like spaces like this that are more efficient and there are hierarchical pathfinding algorithms that basically create bigger grids and pre-calculate which connects with which (info needed only at boundary) and then you can do a higher level search on the bigger grid and then a low-level search for the inside of the grid. This ensures scalability much better. A further speedup to the original A* is to "look ahead" so instead of just using the hint values for the cell to visit - we look ahead and its hint becomes hint values of that + all its neighbors that are k distant from it. This ensures much better heuristic hints at the cost of more operations - but can lead to better results. One can also pair this up with data structures that hold the grid not the usual 2D array ways, but as a hierarchy where close-by elements are more often cache local to each (this is especially powerful if you can make the grid 0s and 1s.

I’ve watched all your videos and I subbed, I can’t wait to see you post more. I really want to get into coding now

this is a great pathfinding algorithm! thanks for the epic video!

This is really cool! What happens if the target is fully encased in solid tiles?

So glad i found your channel! Awesome video and your newer ones look even more interesting ^_^

Heh just seeing this video now, and i love it. The one thing i thought was missing is a final going up the scale as the purple line is drawn in. It was a little disappointing after all that awesomeness to not get that final glissando when it's found the path. Always found that to be the most satisfying part of the sorting method videos.

you can make a c++ priority queue order from minimum to maximum like this: std::priority_queue

I know this is one year late. But the breath first algorithm has 1 upside that the A* cant really compete in. And that is when you have multiple targets, or if you don't know where the targets are on the grid. The second one is fairly simple because the A* requires target locations to work optimally. The first one is not so simple, with a finite set of targets you could optimize it to work, but if the size gets to big even a optimized priority queue that is designed to handle multiple targets you simply lose in complexity gained because you have to iteratively check against all targets, while the breath first simply can simply check on a set if it is contained. It's basically List.indexOf vs Set.contains problem. And pathfinding usually contains multiple targets at once.

🤘🔥 awesome. thanks. that’s really cool. I’m going to tinker around with coding something like that.

Really cool piece of software !

The difference of the sound use is the algorithm is linearly increased, from sorting algorithms is more exciting because of the pseudo randomized opening and the ordered ending

another very epic and cool video

The biggest thing missing is information on each pathfinding. My favorite part about Timo Bingmann's video is that I could identify which sort I liked the best and look it up for more information. I wish I knew which pathfinding algorithm was being used.

How come the final path appears to go through the frontier tiles as seen at 6:06? If they're in the frontier, they shouldn't have been searched yet.

Very nice video!

Really good video!

i didn't expect how satisfying the generation would sound lol

Would be cool to make a game using this. Cool video! : )

This reminds me of, a bit obviously, echolocation, as well as Slime molds!

What library did you use for the visualization?

I was wondering where your other videos are? I'm new to the channel and it seems you've had more videos but I only see four. Sorry if this has already been asked or if I'm wrong about there being past videos. By the way seems like a very good channel!

I love your videos

I think you could have shown Dijkstra and depth first search too. Perhaps djikstra ends up almost doing the same as bfs it still worthwhile pointjng out the differences

4:28 Nooo, I do'nt want to go there, nooo! XD 'perfectly inefficient', could see that it actually would work with the fix you applied🙂

Nice!

HI, how did you created grafics for c++?

So cool!

Hi Mr. Pasta, it's fortunate to see you not being gulped down by philosophers.

Is there a combination of layout and algorithm that would make the audio sound like the harp intro to Zelda's Fairy Fountain theme?

Great video, but could have been better if you showed which approach/algorithm is being implemented after adding the sound effects. you've put in great efforts.

Where is your duck hunt vid? That was really great!

*Adds sounds* Algorithm: -I am cop -Now I am cat on piano

Awesome video! :D

Sound effect should be low fart at the start, then get higher pitched as it gets closer.

Would've been fun to see an algorithm that picks at random, just for the sound of it

You could totally make music with this, and each algorithm would have different methods to do so...

I can't help but wonder if your a* method would have problems if the optimal route to the goal involved substantial back-tracking, especially at the start. All your examples involved only forward-pathing.

I would love to know what C++ Editor you use!

Hey Noodles! Where/How would I get the code for this. I wanted to experiment with the program but I wasn't sure how to do that.

I feel the struggle of the cpu from scanning that algorithm grid lmao

What happened to your duck hunting video, I saw it and liked it but now it's gone?

0:43 Oh is that a "Sounds of the Mandelbrot set"? (colorful ♪)

It's a nice enough video, but A* was kinda base level when I studied computer science more than 20 years ago so there are many many videos explaining it. It'd be nice to see videos that go into the various improvements that have been created since then.

Posted 7 seconds ago this is the earliest I've ever been anyways hello

The efficiency of the second algorithm seems a little suspicious, when you start in x+ direction and the target is exactly in the x+ direction. It would be nice to add at least a part of the c code, to give a hint, what you are doing there.

You should generate a sound in sync with the drawing of the final path. (instead of the silence!)

Cool!

Wow that's why I am subscribed for free codes

Niiiice

I still don't see why you don't have as many subscribers as other channels who do the same kind of content

Why not make both the start and end pathfind to the other until they meet in the middle and make a path? Would it be faster or slower?

This works wonderfully but most of the outcomes are not the shortest distance. Have you improved this algorithm to always give the shortest distance?

Now give this to some music producers and they will make a song by creating a maze!

Wow!

8:21 Me telling a story. 8:24 My gf telling the same story.

Your videos are great, but flashing back to the white background has destroyed my retinas. Please fix in the next patch

7:49 lmfao oof sound

8:24 R2D2 on drugs

Now i wait for Jump Point Search

You should use this to make a pathfinding algorithm play never gonna give you up

if polibeus existed this is tha music

4:28 Generous best-first dearch

7:49 it sounds like the oof sound efect

I believe your videos would be even better if you had less clips of other people laughing or saying something and instead just have yourself, you are way cooler than you probably think, to me at least

7:18 to get to the part of the video you clicked for

8:24 best one

Watching this made me hungry for noodles...

7:50 "OOF"

codenoodles i have a question

I wonder if someone could make music with this…

Nice job. Now use only the notes in the a minor key

Could you fill your character eyes ? It's real scary NGL

hello there

Nice Vid but did you seriously compare A* and BFS ?? A Path finding algo vs a path optimization algo.

its that where did you discover coding and where did you use to code before making custom games

Commenting 4 algorithm

i apprecated the greedy worst-first search

7:50 Oof

That last part, with the noise... feels like it should come with some kind of warning. "Those of sensitive hearing, beware!" or maybe "Please don't listen to this part with headphones in, for your own sake"... something like that. Nice video otherwise, though!~

No Dijkstra's algorithm???

3:43 : Try saying that 3 times fast Me: Greedy Breast F- wait what?

Maybe it's better to use vectors here instead of straight lines, to optimize it's movement

Hello

hi

ThAt soUnd

7:58 why does this sound like the roblox death sound

I think you should put this online so other people can use it.

bet you can't port it to 3ds

2:51 pls don‘t use Nikocado clips. Its satisfying to look at those paths. A cool video.

"Manathan distance" ... use the proper math term "Euclidian distance"

give us the link lmao

then

Earn your early ticket here! Only for 1h

lol 6:40 ratio

The sounds are horrendous

It sounds like "faith" and that's not very poggers ✝️🙏