a-star

相关标签：javascript jquery android 多少钱 iPhone

Unable to implement A Star in java

I\'ve been trying all day to get this algorithm up and running, but I cant for the life of me. I\'ve read many tutorials on the net, and source code in AS3, javascript, and C++; but I cannot adapt wha[详细]

2023-02-22 23:00 分类：问答
What is the most effective way to find the node with the lowest value to expand in A star with heuristic?

im doing the 8 puzzle solver with the a st开发者_如何学Goar algorithm. I implement Manhattan and misplaced heuristic functions in this solver. In some cases, the solver works fine. But in some cases,[详细]

2023-02-22 15:26 分类：问答
Library for tree search for combinatorial optimization problems

I notice that some of the \"hard\" combinatorial problems I come across can be cast in terms of some type of tree search like alpha-beta pruning, or beam search, or a similar algorithm. However, progr[详细]

2023-02-20 19:42 分类：问答
A star search: a lot of nodes and a "slow" CheckLink between nodes... any suggestions?

I\'m fa开发者_如何转开发cing an optimization problem: I\'ve a graph with a lot of nodes (10^5) that represents points on a plane surface.[详细]

2023-02-19 00:38 分类：问答
How can the A* algorithm be applied to the traveling salesman problem? [duplicate]

This question a开发者_JS百科lready has answers here: Closed 11 years ago. Possible Duplicate: Using A* to solve Travelling Salesman Problem[详细]

2023-02-17 17:56 分类：问答
C# AStar problems, won't do it correctly

I am currently working on A* pathfinding, but I am having some problems. It does the wrong path before taking the best path to the end.[详细]

2023-02-16 15:33 分类：问答
scaling factor for the cost distance between nodes in A* algorithm

I have a set data which is a collection of node - node - associated cost. This cost is represented as a开发者_C百科 distance in feet.[详细]

2023-02-15 10:28 分类：问答
A* algorithm with euclidean distance

If I have a set of nodes with coordinates (x, y) and I have a set of node - node - cost, in this case the cost is in minute. How do I calculate the Euclidean distance assuming the 开发者_如何学运维spe[详细]

2023-02-15 05:12 分类：问答
how to find the best three routes using A* algorithm

In A* usually the result that you get is only one path. Is it possible though for a given origin and destination to have 3 recommended path according to A*? So the second returned is the second best p[详细]

2023-02-15 04:10 分类：问答
Heap that supports modification of its elements?

Here is my scenario. I wa开发者_开发知识库nt to implement A* (in Python) without having to resort to linear-time min or in operations. I need a heap to be able to efficiently get the lowest weight ite[详细]

2023-02-12 14:22 分类：问答