We’re rewarding the question askers & reputations are being recalculated! Read more.

Questions tagged [search]

For questions involving search algorithms and their use in artificial intelligence

Filter by
Sorted by
Tagged with
4
votes
1answer
7k views

What are the differences between A* and greedy best-first search?

What are the differences between the A* algorithm and the greedy best-first search algorithm? Which one should I use? Which algorithm is the better one, and why?
5
votes
1answer
5k views

What is the fringe in the context of search algorithms?

What is the fringe in the context of search algorithms?
4
votes
1answer
2k views

How is iterative deepening A* better than A*?

The iterative deepening A* search is an algorithm that can find the shortest path between a designated start node and any member of a set of goals. The A* algorithm evaluates nodes by combining the ...
8
votes
8answers
2k views

Why is search important in AI?

Why is search important in AI? What kinds of search algorithms are used in AI? How do they improve the result of an AI?
9
votes
3answers
7k views

What is the difference between tree search and graph search?

I have read various answers to this question at different places, but I am still missing something. What I have understood is that a graph search holds a closed list, with all expanded nodes, so ...
10
votes
4answers
2k views

When to choose Stochastic Hill Climbing over Steepest Hill Climbing?

Stochastic Hill Climbing generally performs worse than Steepest Hill Climbing, but what are the cases in which the former performs better?
6
votes
1answer
53 views

Can two admissable heuristics not dominate each other?

I am working on a project for my artificial intelligence class. I was wondering if I have 2 admissible heuristics, A and B, is it possible that A does not dominate B and B does not dominate A? I am ...
8
votes
2answers
106 views

Memory intensive local search methods

I have been studying local search algorithms such as greedy hill climbing, stochastic hill climbing, simulated annealing etc. I have noticed that most of these methods take up very little memory as ...
4
votes
1answer
2k views

How do I show that uniform-cost search is a special case of A*?

How do I show that uniform-cost search is a special case of A*? How do I prove this?
2
votes
2answers
147 views

Which Algorithm is best for Robots? [closed]

I am a student and I study Algorithms like tree search algorithm graph search algorithm Then apply BFS DFS UCS IDS DLS Where are all these algorithms are used? I know there is a long list of ...