The Stack Overflow podcast is back! Listen to an interview with our new CEO.

Questions tagged [a-star]

A* is a graph shortest-path algorithm that uses a heuristic function to speed up the search

Filter by
Sorted by
Tagged with
12
votes
1answer
343 views

A* Go application

I've written a generic implementation of the A* algorithm as a first Go program, since I had implemented that both in C and in Python before and Go reminds me a bit of both. I'm looking for general ...
14
votes
2answers
2k views

A* search in MATLAB

I have implemented A* search in MATLAB, but I am looking for ways to increase the speed and optimize it. I have tried using a priority queue but I found it doesn't work that well, so I am using a ...
10
votes
2answers
254 views

Typesetting A* in LaTeX using algorithm2e

(See the next iteration.) The result looks like and my code is: ...
3
votes
1answer
8k views

8-Puzzle using A* and Manhattan Distance

I have developed this 8-puzzle solver using A* with manhattan distance. Appreciate if you can help/guide me regarding: 1. Improving the readability and optimization of the code. 2. I am using sort to ...
4
votes
2answers
2k views

My 15 puzzle solver is too slow

It takes my code over 700 seconds to solve simple puzzle: 2 7 11 5 13 0 9 4 14 1 8 6 10 3 12 15 My function ...
13
votes
1answer
7k views

Solving 15 puzzle

I'm trying to solve 15 puzzle using A* algorithm, but something really bad goes on in my get_solution() function that ruins performance. I guess there is a too much ...
2
votes
1answer
469 views

A* search algorithm: classes

So, this is a ton of code, but that's what I came up with for an efficient and extendable implementation of the A* search algorithm. The first four classes can be seen as interfaces to show the user ...
5
votes
1answer
2k views

A* search algorithm: open set and heap

I'm working on an A* search algorithm implemention and this is what I came up with for the open list: ...