Let's say I have a 500x500 2D grid (from -250 to 250). Each cell of the grid has a certain value, from 0 to 100. What I've been trying to do is keep a list of all the cell with a value lower than 50 starting at the point (0, 0), but I would like not
So, I want to implement AI to my LibGDX 2d platformer game. I have read stuff about A* pathfinding, but I think that if I make an A* pathfinding the performance would be very bad(on android), it is not great already. Then I stumbled upon an article w
So I have a task, that is, to write a function that takes a parents array produced by a traversal, a starting vertex, and an end vertex, and produces a path from the start vertex to the end vertex. I have tried writing the code for this def tree_path
Once again having a problem with path finding this time The Dijkstra's I have read Dijkstra's and its application on a various number of sites. It's mostly explained for a Graph and finding out the shortest path to all nodes from a source node. What
I have a project to have a red dot inside the first box of a maze i randomly generated and the dot is supposed to follow its way through the boxes and find the end of the maze. Now if it hits a dead end, its supposed to go back to where its path star
I want to write a .bat script which finds a folder for installed program (e.g. Acrobat\JavaScript) because the folder can have a different path on every computer. Then put a .js file and a imgfolder inside. The .js file and the imgfolder is in the sa
I have implemented an A* algorithm for a simple 2d grid based game. However the algorithm slows the game down a lot and I recently learned about HPA* which is meant to try and solve this issue to an extent. I can't really find any coding examples of
I am trying to program a pathfinder on the worlds oceans. I have used an A* algorithm on a cell mesh containing land and water cells previously. But I think that a better solution will be to have continents and islands and polygons; calculate a visib
I am currently trying to implement a recursive snake path-finding algorithm. I tried to make something, but a problem came up that I find hard to fix. The problem is that my program is only searching for the path once and that for unknown reasons it
<!DOCTYPE html> <html> <head> <title></title> <script src="http://code.jquery.com/jquery-latest.min.js"></script> <script> $(function(){ $('body').click(function(e){ $('div').html(e.pageX +', '+ e.pageY
I want to implement a 8-direction path finding algorithm by JavaScript. I found a algorithm, Jump Point Search. I see it's very good but I can't found a simply demo of this algorithm. Anybody can help me? --------------Solutions------------- You can
Could anyone give me an example of source code which uses astar pathfinding algorithm with AndEngine on the TMXTiledMap. I am using AndEngine downloaded from https://github.com/nicolasgramlich/AndEngine. Any suggestion would be appreciated. Thanks! -
I need an algorithm that goes from point_a to point_b spending a given n pixels(or I could consider squares [with the area larger than a pixel] as being one pixel). For example: if, in the cartesian plan, point_a = (0,0) and point_b = (100, 150), and
I'm implementing the A* algorithm using std::priority_queue on the openSet. At some point on the algorithm, as in wikipedia pseudo-code: else if tentative_g_score < g_score[neighbor] tentative_is_better := true followed by if tentative_is_better =
In a tower defense game, you have an NxM grid with a start, a finish, and a number of walls. Enemies take the shortest path from start to finish without passing through any walls (they aren't usually constrained to the grid, but for simplicity's sake
What are some path finding algorithms used in games of all types? (Of all types where characters move, anyway) Is Dijkstra's ever used? I'm not really looking to code anything; just doing some research, though if you paste pseudocode or something, th
I want to find whether there is a path from one point to another or not. For example, 2 -> 4 -> 7 1 -> 3 -> 2 -> 9 5 -> 1 -> 6 -> 8 these are the path. I want to write a predicate path(Start, End), and arcs are represented by
I am working on images for a personal project and I stuck at a step (moreover it is a relatively easier step) My question is not related to the images by the way. I am calculating int values for each pixel on the image. And I want to find the path wi
Is there a pathfinding algorithm also suited for real 3D environments e.g. real Buildings with multiple stairs etc. A C++ library or open implementation would be splendid ;-) One solution I saw was Djikstra but I wonder whether there is something mor
I realize this is not strictly related to programming problems but as SO is the best resource for programming related problems, I decided to try it out. :) I have a project where I need to do 3D pathfinding with javascript, inside a building. Dijkstr