Questions tagged [heuristics]

Heuristics refers to the use of algorithms to deal with highly complex problems.

Heuristics refers to the use of algorithms to deal with highly complex problems. A heuristic approach seeks to provide an approximate solution for a problem that is otherwise unsolvable.

683 questions
0
votes
3 answers

Is there any non-heuristic approach in resolving these types of problems

I am trying to resolve the following problem. Given the following: resources: food, wood, stone, gold units: peon(requirements: 50 food, town hall, 3 turns to make) which can produce: 10 amount of any resource or 3 building points …
Zoltan Ersek
  • 755
  • 9
  • 28
0
votes
1 answer

Heuristic for A* when only diagonal movement is allowed

I'm planning to use A* algorithm for path finding on a infinite grid with obstacles where only diagonal movements are allowed.But I'm not sure about which heuristic to use.I know that I cannot use Manhattan Distance.Can anyone suggest something ?
Arun
  • 55
  • 1
  • 7
0
votes
1 answer

How is the max of a set of admissible heuristics, a dominating heuristic?

If you have a set of admissible heuristics: h1,h2,h2,...,hn How is h = max(h1,h2,h2,...,hn) an admissible heuristic that dominates them all? Isn't a lower h(n) value better? For A*, f = g + n, and the element with the lowest f will be removed from…
Brejuro
  • 3,421
  • 8
  • 34
  • 61
0
votes
2 answers

How to reduce long execution time in an A* search for 8-puzzle

I'm trying to implement heuristic search strategy A* to the puzzle "8-puzzle" in Lisp. To run my search I use the command: (run-best '(0 1 2 3 4 5 6 B 7) '(0 1 2 3 4 5 6 7 B)) Where the first state is the start goal and the second is the end…
Asia x3
  • 606
  • 2
  • 16
  • 37
0
votes
2 answers

Find the combination of numbers that is a close as can be to a specific number

I have a vector A, that is A = [300; 165; 150; 150; 400; 300; 80; 250; 165; 80; 200] I am trying to find a set of vectors that are composed of the elements of this vector A so that their elements sum up to a value as close as possible to 400 and…
ayca altay
  • 51
  • 1
  • 8
0
votes
1 answer

Determine if a URL is in the header/footer of a web page given URL, page DOM, parent URL and other page URLs

Given a URL, the URL of the webpage that first URL is on, the DOM of the webpage, and a list of the rest of the URLs on the webpage how can I reliably determine if the URL is in the header/footer of the page or if it's in neither? I'm using…
Chad
  • 3,159
  • 4
  • 33
  • 43
0
votes
1 answer

Combining multiple genetic operators

Please correct me if I'm wrong, but it is my understanding that crossovers tend to lead towards local optima, while mutation increases the random walk of the search thus tend to help in escaping local optima tendencies. This insight I got from…
oaskamay
  • 274
  • 3
  • 16
0
votes
1 answer

NSGA 2: PseudoCode

I need to use a multi objective optimization algorithm accurately NSGA 2. And I couldn't find in the web a clear and detailed pseudocode of NSGA2 to be able to imlement it. Thanks in advance.
0
votes
1 answer

Splitting a set of object into several subsets according to certain evaluation

Suppose I have a set of objects, S. There is an algorithm f that, given a set S builds certain data structure D on it: f(S) = D. If S is large and/or contains vastly different objects, D becomes large, to the point of being unusable (i.e. not…
user319799
0
votes
2 answers

Balancing heuristics (for timetable problem)

I'm writing a genetic algorithm for generating timetables. At the moment I'm using these two heuristics: Number of holes between lectures in one day (related) (less holes -> bigger score) Each hour has some value, so for each timetable I sum…
Uros K
  • 3,274
  • 4
  • 31
  • 45
0
votes
1 answer

What are some common admissible heuristics for distance?

What are the most common heuristics used to estimate distance in intelligent search problems? In particular, I'm interested in metrics that can (usually) be used as admissible heuristics for A* search. I came across straight line distance and…
kris
  • 39
  • 2
  • 4
0
votes
1 answer

Generating a set of random numbers that form sum under two combinations

I want to generate 16 random non-negative integers, say a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p. a+b+c+d = a particular sum e+f+g+h = another sum i+j+k+l = another sum m+n+o+p = another sum This much is pretty easy. But, the trouble is, a+e+i+m = another…
0
votes
3 answers

Heuristic for sliding tile problem

The idea is to move all of the right elements into the left and the left into the right with an empty space in the middle. The elements can either jump over one or two pieces into an empty space. LLL[ ]RRR I'm trying to think of a heuristic for…
MustDash
0
votes
0 answers

Distinguish between text and code in a post

I was wondering if there was any acceptable way of doing it. I want to distinguish between code and text in some emails or long posts, in order to highlight the code differently. I was thinking about something like if(this line and next 10 lines…
cedivad
  • 2,544
  • 6
  • 32
  • 41
0
votes
1 answer

Exponential problems and their C representation

I came across well-known N-Queen problem and I was wondering how to write a program to calculate number of possibilities in this particular problem. My program can find solution fast for really small N's (since it's heuristic). I'd also like to…
bottaio
  • 4,963
  • 3
  • 19
  • 43