Linked Questions
13 questions linked to/from How does A* pathfinding work?
2
votes
1
answer
867
views
2D LibGDX Collision Avoidance [duplicate]
I would like to know what is the best way to implement collision avoidance and eventually pathfinding in a LibGDX 2D top view game. Think of "Binding of Isaac".
I use a sort of tilemap to place the ...
1
vote
1
answer
174
views
A* pathfinding question [duplicate]
I'm trying to get a grasp on the A* pathfinding algorithm. Using the image I attached.
If the green square represents the start, and red represents the end. wouldn't the algorithm bring me up towards ...
1
vote
0
answers
35
views
Intermediate AI for Java games [duplicate]
I want to know how to create good AI for a Java game, I'm still learning the language and I'm not an expert.
I can do static AI but wanna know about writing an AI that follows the player and ...
16
votes
9
answers
8k
views
Dynamic pathing algorithm for tower defense game
I'm making a Tower Defense and I need a good pathing algorithm for it.
I have thought about Dijkstra but I need one that can be dynamic; it must be able to update itself when one edge is removed or ...
1
vote
3
answers
3k
views
Why can't my A* implementation find a path out of an open room?
I tried to follow this article with the following example, but in my attempts it always ends up with a dead end.
If we take G being 10 in a straight line or 14 in a diagonal, and H the distance in ...
6
votes
4
answers
3k
views
Find nearest tile of type x
I currently have an array of tiles which makes up the tilemap (stored as an int array) and I want an NPC to be able to move itself to the nearest tile of type X (ie find the nearest tree and chop it ...
4
votes
5
answers
2k
views
How can I imitate interaction and movement in Diablo II?
I'm prototyping a simple browser-based game. It's played from a top down perspective on a 2d canvas.
You left-click on a point on the map, and your character will begin walking to it. If you click ...
2
votes
1
answer
3k
views
How does D* pathfinding work?
I would like to understand on a fundamental level the way in which D* pathfinding works. Any code or psuedo-code implementations as well as visualizations would be helpful.
0
votes
1
answer
1k
views
A* algorithm: is the heuristic h an input?
We have a formula of f=g+h wherein g is the path cost and h is the distance left to the goal....
1
vote
1
answer
208
views
Path finding with identical values
I have been reading up about path finding and find it all very confusing, however this is probably the best I have found for a logical explanation:
Path
If the cost of two nodes has the same value, ...
0
votes
1
answer
334
views
Pathfinding Algorithms [closed]
I am new to game programming I currently am using unity's 2D power to remake an 2D game for sake of practice. So I am just little confuse about one thing, so far every enemy in my game was dumb(they ...
-1
votes
1
answer
212
views
How will you go about designing A* pathfinding for a pong game?
I want to design A* path finding in the pong 2d game.
As far as I know I can just simply design an Ai as in
...
0
votes
1
answer
170
views
Heuristic Cost in A* algorithm
I have been learning about the A* path finding algorithm and I can't understand the heuristic cost in this algorithm. What is it and what is its use in the algorithm?