There's a hot girl who works at the coffee shop near my place. Do you think A* would work in helping me find a way to a date with her? And what's the shortest, least expensive path into her bedroom? :-(
can anyone give suggestions on the most efficient way to record all the data (aka. the best way to "remember" tiles) in order to allow the program to easily "realise" that it has already been on a tile ? :)
Hi Dooobs :) I have read many articles to understand the AStar concepts, but your video is by far the one that helped me the most to code it. Thanks Again
@YourAppleTechHelp Hey, sure. Essentially there isn't really much of a difference between a point and a tile. In fact in my code they are labeled 'Nodes' and the way they are linked is to just have a connection between to nodes. So in that sense the tiles (or nodes) don't even to be next to each other. You could have them spread out as much as you like as long as each node has at least one connection.
I was working on A* on a node network but it failed. This was really step by step and finally I figured it out. Rewrote what I had earlier but now it works perfectly!
There's a hot girl who works at the coffee shop near my place. Do you think A* would work in helping me find a way to a date with her? And what's the shortest, least expensive path into her bedroom? :-(
kevnar 3 months ago
thx cool tut
TheMemorius 7 months ago
can anyone give suggestions on the most efficient way to record all the data (aka. the best way to "remember" tiles) in order to allow the program to easily "realise" that it has already been on a tile ? :)
retromelon123 8 months ago
Hi Dooobs :) I have read many articles to understand the AStar concepts, but your video is by far the one that helped me the most to code it. Thanks Again
rankoblitz 9 months ago
This has been flagged as spam show
nice tutorial man....can you please send me your laboratory code to my mail id : shubham.baranwal@gmail.com
MrShubh16 1 year ago
very good =) i am trying to make this in my RPG... is it easy to do with points aswell? (since i don't have tiles in my game)
YourAppleTechHelp 1 year ago
@YourAppleTechHelp Hey, sure. Essentially there isn't really much of a difference between a point and a tile. In fact in my code they are labeled 'Nodes' and the way they are linked is to just have a connection between to nodes. So in that sense the tiles (or nodes) don't even to be next to each other. You could have them spread out as much as you like as long as each node has at least one connection.
Dooobs 1 year ago
This is breadth first search? Or am I being confused?
mixmasterxp 1 year ago
hey, doooooobs where is scooooobs!?!
anandmohan88 1 year ago
I dont like how you say...it "realizes"...it would be nice if u explained whats happening
Shad12Dash 1 year ago
This is a very clear graphical explaination to the A* algorithm! A cookie for you Dooobs! :D
DesmondMarilyn 2 years ago
Thanks a lot!
I was working on A* on a node network but it failed. This was really step by step and finally I figured it out. Rewrote what I had earlier but now it works perfectly!
Thanks to you.
SteelSNP 2 years ago
So once you reach the finish node, how do you determine which path to take?
fiend7777 2 years ago
thanks a ton.....u made it quite clear!!!!
prahasaranraja 2 years ago 4
thankz a lot...
smartorahu 2 years ago
Nice tutorial, thanks for sharing!
CrazyEoin 2 years ago
Thanks for watching :)
Dooobs 2 years ago
Cool tutorial.
dandymcgee 2 years ago 4