I have created an path finding algorithm visuliser using pygame, that shows A* Vs. Dijkstra’s Algorith. the start node,end node and obstacles are all randomly positioned as such in order to evaluate, my algorithms I am constraining the distance between the start and end node (for small, medium and large) and thus need to make the end node eg (10,30,50)
Tag: path-finding
Path through specific vertices without an end point
I am trying to write an algorithm solving a type of maze. It could look something like this: The player character is the red circle and the goal is to collect all the blue squares. The player can move up, down, left or right but only stops when hitting a wall. I start by converting the maze into a graph(going
Fast pathfinding and distance matrix in 2d grid
Context: I’m working on a warehouse simulation that supports different floor designs and simulates one or multiple agents that are tasked with order picking. One order can consist of more than one product. The routing for picking products is solved as a capacitated vehicle routing problem (CVRP). This requires a distance matrix between product locations, for which the A* algorithm
Maze pathfinding implementation (BFS) not giving correct path [closed]
Closed. This question needs debugging details. It is not currently accepting answers. Edit the question to include desired behavior, a specific problem or error, and the shortest code necessary to reproduce the problem. This will help others answer the question. Closed 1 year ago. Improve this question I am trying to get the shortest path for a maze with a