I have a graph in which each node is a geographical point on the surface of the earth, defined by it's latitude / longitude coordinates. Correct ways to calculate the distance between two such points ...
Say we have our route finding algorithm: def myHeuristicTSP(graph): /*implementation*/ return route Now we want to unit test this: class TestMyHeuristicTSP: def ...
I have created a DIFF implementation to compare document revisions at work. It is based on An O(ND) Difference Algorithm and Its Variations. One thing that has become important is to take the list ...
Hello I am trying to use the alienTile problem described at www.alientiles.com using the A* algorithm but I cannot find any good heuristic function so far. In alien tiles you have a board with NxN ...
I have a homework problem for an Artificial Intelligence course that I am having trouble answering. Consider solving the Sudoku problem using A* search. The start state has some number of cells ...
I am working with A* algorithm, in which I have a 2D grid and given two points, find the shortest distance between them, while not running into any obstruction. Now, for each cell, I find the ...
Given sorted data, the search solution is obvious. Given unsorted data, sensible options are sort then search or just linear search. This question is about what to do if the data is somewhat sorted, ...
I'm interested to know if heuristic-based path-finding algorithms such as A* have any real world practical use outside the realm of game development. Are there any other fields of software ...
In a previous question, I asked about finding a route (or path if you will) in a city. That is all dandy. The solution I chose was with the A* algorithm, which really seems to suit my needs. What I ...
Here's a common situation: You need to implement a bulk operation in an application that uses an ORM framework. After the first pass, you've noticed significant performance problems. Here's my ...