3 ms·
It's even more than that. You can get great results from A* on any graph search problem where you can find a good heuristic for the distance to the goal from so
by ggambetta 12y ago
It's even more than that. You can get great results from A* on any graph search problem where you can find a good heuristic for the distance to the goal from some node, which may not be related to position at all. For example, I once did this with nodes that represented sets of database attributes and arcs that represented table joins.
- Vaskivo 12y agoA* is not only a pathfinding algorithm, but a search algorithm. In my AI classes I used it for pathfinding, solving sudokus and other puzzles, and even to solve a job shop scheduling problem[1]. If you can translate your problem into a graph, you can use A* with it. In these classes, we had a problem to solve, and we had to solve it using different algorithms and in the end submit a report in wich we compared the result and efficiency of each. The ones that used heuristics, we had to implement about three different heuristics, analyze each and mix them up. [1] https://en.wikipedia.org/wiki/Job_shop_scheduling https://en.wikipedia.org/wiki/Job_shop_scheduling