Path Planning #2 Wave Propagation, Potential Fields & Modern(ish) C++ 

Hello, two quick things! 1) I'm fully aware that this implementation is NOT OPTIMISED. There are ways to make this faster, but I wanted to show and use some modern C++ ideas. 2) My apologies for the voice changing. Half was filmed with my morning voice, and half with my evening voice which is unusual for me, but some IRL stuff got in the way!

I love your videos bc the kind of linear logical math thinking you need for programming doesn’t come naturally to me, but your explanations help me see things from another perspective

You are a goldmine of knowledge and an amazing teacher!

Amazing. So cool to see the dynamic pathfinding, as you make obstacles.

Very good work and well explained topic, mate! Keep it up!

Hey Javid, first of all your explanation is very good both verbally as well as visually also and it would be very helpful if you can explain about local minima trap in potential fields and how we can avoid it

yay, new video

This may be very useful to my friends making similar projects

you are simply the best

I done this exact algorithm for my Deluxe Pacman game years ago. Except, it didn't have a name that I knew of, it's just something I came up with. I didn't mark duplicate nodes discovered already though. Instead, I would have a flag which indicated that node had already been discovered. Either a separate flag for each node, or just set the node value to something like -2, which would indicate it was a node you already discovered an added to your list. This way you have no need to search for duplicates. One huge benefit of this method, is in my game, I only had to update it when pacman (the target) moved to a new node. And even then, it was the ghosts that use this to path to him, they only needed to update it when they reached a junction where they needed to choose from several paths available. If the target hadn't moved to a new node, they could use the existing path map. The beauty of this is, no matter how many ghosts I have (four) that need this path, they can ALL use the same path map because the numbers all have to do with the target and the distance from the target in each node, so just pick ANY starting point after you calculated the distance for each node, and you can see that you can find the shortest path from any point to the target without recalculating. Very handy, especially for games where the target doesn't move, but the source location can change or have multiple units using it (a group of infantry or tanks all headed towards a building to destroy from all over the map for example). Edit: LOL, I guess I should have watched the whole video before I typed this. ;)

Great video.

Great video, even with twin voices :-) Learned a lot! Thank you.

Nice video there

another cool view

Good

Yee!

Thank you, very interesting and helpful video. I have a question, why didn't we just use to automatically remove duplicates and sort the values. Or if we didn't want to sort we could use which removes duplicates and works in constant time O(1)

@javidx9 are u able to do a* program for special order on different languages ?

Hello, I have a question about your older type videos (console games). Let's say I have a simple player which is represented by 'X'. It is possible to draw and move it using floating position? (in console). Also your engine helped me a lot with constructing console etc. (I'm not using it beacuse I'm creating school project), windows.h has awful variables and functions names, even TRUE is capitalized, lol. Love your videos too (hate your naming habit e.g nPosition tho). Thanks for response.

Hello Javidx9! Fantastic videos on your channel, always pleasant to watch. I have one question though, what was the main reason why you've chosen C++ over C back in the day? And what do you think about C pros over C++ in terms of GameDev? (if there are any :) )

great video what is the best book in data structure?plz

20:41: WHOO HOO! Proper use of curly braces!

@javidx9 Sets can help you out agains the duplications.

Can you explain implementation of the draw(...) Or drawline(...) Function? Ive seen you using it in making od 3d engine and other videos. How does it work? Btv i have seen olcconsolegameengine explanation and it didnt satisfy me...

It's just a simple BFS in algorithm aspect.

If one builds on this, it could potentially make a basic echo simulator

Why can't you mark a newly discovered node with its distance right away? That way, if in the same propagation round, another node finds it it will immediately know it was already found. Isn't it guaranteed that each round always finds new nodes at the same distance away from the target? The whole duplicate removal seems redundant... But maybe I'm just tired. Wonderful video as always!!

After watching almost every video in this channel I realized you always use two variable two represent a point in 2D, why not use a struct with X and Y? Any particular reason or that's just how you've always done?

do you have a Dijkstra video?

This algo is most likely used in fire emblem for character and cursor movement. Very cool.

Can we change the size in the DrawString function?

If only I could figure out how to make this work in a 2d platformer

i found this kata to be quite intresting. its more or less the same principal as usual path finding but with a nice twitst and some nostalgia for the old nes-games www.codewars.com/kata/ascii-games-warning-ice

do you have a video that explain how to implements A star for multiple agents trying to reach multiple destinations

This looks like an airplane schema xd

Seems like Dijkstra

I have a question: do we have to download anything such as a Flowfield Pathfinder. I checked and it's on sale. If I can do things like this video I happily buy it but I need to know exactly what I'm download. Please let me know.

djikstra

Why you doesnt use for(&a : path) ? 39:05

Why use a list and not a vector?

What is the framework that you usually use when creating the maps and other GUIs?

this could also be sweep, multipass, filled, mine sweeper style, single 2d or 3d array needed, single toggle z-buffer for direct visibility 2.5d or 3d

how does this wave propagation pathing compare with flow field pathfinding?

How can I find the longest path not using an algorithm with NP complexity?

take my D value d value