Stack Overflow
Stack Overflow

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
1 answer

What is the difference between state evaluation and heuristics in game-AI?

I am trying to implement a minimax algorithm for an AI player within a simple card game. However, from doing research I am confused what are the key differences between state evaluation and heuristics. From what I understand heuristics are…
PaddyOB
  • 11
  • 2
0
votes
2 answers

Looking for ideas/references/keywords: adaptive-parameter-control of a search algorithm (online-learning)

I'm looking for ideas/experiences/references/keywords regarding an adaptive-parameter-control of search algorithm parameters (online-learning) in combinatorial-optimization. A bit more detail: I have a framework, which is responsible for optimizing…
sascha
  • 32,238
  • 6
  • 68
  • 110
0
votes
0 answers

River crossing puzzle

I was thinking about implementing the classical river crossing puzzle game and I was wondering what would be the most appropriate search algorithm to solve it. Here is an example of the game Apparently there is enough information to predict the…
Jason Per
  • 139
  • 2
  • 12
0
votes
2 answers

Comparison of A* heuristics for solving an N-puzzle

I am trying to solve the N-puzzle using the A* algorithm with 3 different heuristic functions. I want to know how to compare each of the heuristics in terms of time complexity. The heuristics I am using are: manhattan distance , manhattan distance +…
Petros Sofianos
  • 11
  • 3
0
votes
0 answers

More work like Judea Pearl's Heuristics?

I am researching formal and informal search heuristics. One of the best books on the subject I've found is Judea Pearl's Heuristics. Embarrassingly, I find myself unable to find a good search strategy that returns more material in this vein. Things…
Romeo Stevens
  • 1
  • 1
0
votes
1 answer

How can I better optimize a search in possible Fantasyland constructions in Pineapple poker?

So, a bit of explanation to preface the question. In variants of Open Face Chinese poker, you are dealt one and one card, which are to be placed into three different rows, and the goal is to make each row increasingly better, and of course getting…
Nicholas Tidemann
  • 55
  • 4
0
votes
1 answer

Tabu list length vs cadency

I'm trying to solve TSP problem with tabu search. I understand most foundations of this heuristic method. But I have trouble with figuring out what is the difference between cadence of some tabu move and length of tabu list. These two data…
radeko
  • 33
  • 1
  • 4
0
votes
1 answer

TSP with a twist

I've encountered a problem that is very similar to the Traveling Salesman Problem, except with a few twists: You are able to visit the same node multiple times Traveling an edge that you have already traversed before is costless The graph is…
Sherida van den Bent
  • 43
  • 6
0
votes
1 answer

Heuristics for A* algorithm in a weighted graph

I'm making an app for a school project that finds the shortest path between 2 room on the campus. there're 100+ rooms so I don't think Dijkstra can be used. all the heuristics I've found so far are for game path finding. Can I use these? What's the…
Swilze
  • 1
  • 1
0
votes
2 answers

Heuristics for the Asymmetric Traveling Salesman

I am using A* in order to solve the Asymmetric Traveling Salesman problem. My state representation has 4 variables: 1 - Visited cities (List) 2 - Unvisitied cities (List) 3 - Current City (Integer) 4 - Current Cost (Integer) However, even tho I find…
Luís Pedro Borges
  • 71
  • 9
0
votes
1 answer

Heuristic function for solving weighted 15 puzzle

I am looking for a heuristic function to solve a "weighted 15 puzzle" problem. It's the same as "15 puzzle" only i'm looking for the minimal path to 1-15 (Link) when each "switch" costs as the piece we're moving.
Tango_Chaser
  • 319
  • 1
  • 3
  • 13
0
votes
1 answer

Confused about monotonic heuristics

I am currently working on a assignment for my A.I course. I am currently struggling to prove that something is not monotonic rather then the opposite. So far, I can't seem to find a way to prove this without knowing the cost of moving from n -> n',…
Gipjoe
  • 63
  • 5
0
votes
1 answer

Minimize cost of tree path in a digraph

I have a weighted directed graph, with negative and positive weights, i want to minimize the cost of the arcs with a tree given the root ( node in graph). Note that covering all the nodes is not important. I want to minimize the cost of…
Kondecigs
  • 31
  • 1
  • 7
0
votes
2 answers

perl: Is there a heuristic for finding mismatched braces/brackets/parens etc

I'm using perl to parse a json file. When all is OK, I find matching braces fine. But if there is a mismatch, I can't think of a good way of finding where it is. My data at this point is a sorted array (@merged) of offsets of braces in the file,…
user1067305
  • 3,233
  • 7
  • 24
  • 29
0
votes
1 answer

Good Heuristic for Connect-K AI

I'm writing a Connect-K simple AI (no pruning, 4-ply only). I was wondering what is the best heuristic that is fast to calculate. Something better than what I have: def eval(board, player) connections = 0 magnitude = 0 for x in range(0,…
Artur Grigio
  • 5,185
  • 8
  • 45
  • 65
1 2 3
…
45 46