All Questions
Tagged with pathfinding java
62 questions
1
vote
0
answers
57
views
Fixed BIDDFS (bidirectional iterative deepening depth first search) in Java
Intro
I have this GitHub repository for doing pathfinding in directed unweighted graphs. This post is about BIDDFS proposed by Richard Korf in his paper.
Code
...
- 31.3k
1
vote
0
answers
30
views
LibID: a Java library containing some iterative deepening algorithms for pathfinding on directed unweighted graphs
Intro
I have this GitHub repository containing some iterative deepening pathfinding algorithms.
Code
...
- 31.3k
3
votes
1
answer
131
views
Multithreaded 8x8 grid 63-move path Pathfinding
This program primary effort is the pathfinding of an 8x8 grid without the use of Java Collection Framework.
The starting cell is at the top left corner and the end is the bottom left corner. All valid ...
2
votes
2
answers
475
views
8
votes
3
answers
2k
views
A* (shortest path) with the ability to remove up to one wall
Problem
You are given an HxW matrix. Each element is either 0 (passable space) or 1 (wall).
Given that you can remove one wall, find the shortest path from [0,0] (start)
to [width-1, height-1] (end).
...
- 183
2
votes
1
answer
377
views
Sum of all Paths in Binary Tree
Problem
For the given binary tree return the list which has sum of every paths in a tree. i.e Every path from root to leaf.
I've written following solution.
...
- 281
5
votes
2
answers
111
views
Performance Enhancement of A Star Path Finder algorithm with 1024 multidimentional array
I have the below code for a A* pathfinder, however it is taking upwards of 10 minutes to find a solution using a simple 1024 x 1024 array.
I had to comment out ...
- 51
2
votes
0
answers
161
views
Faster k-shortest path algorithm in Java
In the \$k\$-shortest path problem, we are searching for (at most) \$k\$ distinct, shortest paths connecting two given terminal nodes. You can see the previous version here. This implementation, ...
- 31.3k
2
votes
1
answer
198
views
Implementation of Dijkstra algorithm
I am trying to implement Dijkstra algorithm. I try to calculate cost of reaching every node from first node. Though I have tried with couple of graphs and results are correct but I have one doubt ...
- 191
3
votes
1
answer
161
views
Maze navigator AI
I developed a maze navigator in Java for a project for my school. It works fine, and it gets through the maze just fine. The program prints to the screen each time it loops through the maze to set the ...
- 10.7k
0
votes
0
answers
7k
views
Find the shortest path between two points in a 2D matrix with obstacles
I need to find shortest path between two points in a grid given an obstacles..
Given a 2 dimensional matrix where some of the elements are filled
with 1 and rest of the elements are filled. Here X ...
- 499
3
votes
1
answer
3k
views
Java breadth-first search for finding the shortest path on a 2D grid with obstacles
Please review my Breadth-first search algorithm implementation in Java for finding the shortest path on a 2D grid map with obstacles.
The findPath() method ...
- 399
3
votes
1
answer
1k
views
Java Pathfinding Lee Algorithm
For my Pacman game i need to implement a pathfinding algorithm. I decide to do it with the Lee Algorithm, because in my opinion it's easier to understand than e.g. A* Star algorithm.
I tried to ...
- 605
2
votes
0
answers
74
views
Shortest path via intermediaries
Created a shortest path finder that must pass via sets of intermediary edges (either one in each set counts as a pass) in order.
Primarily I would like to know if there are logical fallacies in the ...
- 131
2
votes
3
answers
2k
views
Find the longest path in a matrix where each step has entries that differ by 1
Given an N*N matrix that all numbers are distinct in it, the function should find the maximum length path (starting from any cell) such that all the cells along the path are in increasing order with a ...
- 31