The tag has no wiki summary.

learn more… | top users | synonyms

1
vote
1answer
104 views

Why are heuristics a disadvantage for decidable problems?

I'm reading Introduction to Artificial Intelligence by Ertel. This line has me stumped from the textbook (page 102): For decidable problems such as the 8-puzzle this means that the whole search ...
4
votes
1answer
86 views

Mathematically correct A* heuristic / distance estimator for a latitude / longitude graph

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 ...
7
votes
2answers
318 views

How do I unit test a heuristic algorithm?

Say we have our route finding algorithm: def myHeuristicTSP(graph): /*implementation*/ return route Now we want to unit test this: class TestMyHeuristicTSP: def ...
6
votes
1answer
185 views

Heuristic Approach for Flexible DIFF Implementation

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 ...
0
votes
0answers
95 views

AlienTiles optimistic heuristic function

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 ...
0
votes
3answers
680 views

A* search for Sudoku

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 ...
0
votes
1answer
94 views

How to find the running time of an algorithm that involves heuristics

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 ...
8
votes
1answer
339 views

heuristic for searching through non-perfectly sorted data

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, ...
14
votes
7answers
2k views

Do path-finding algorithms have practical use outside of game development?

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 ...
6
votes
5answers
459 views

Finding an A* heuristic for a directed graph

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 ...
13
votes
8answers
963 views

Should you abandon an ORM framework when you need to implement a bulk operation?

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 ...