Questions tagged [search]

For questions involving search algorithms and their use in artificial intelligence

Filter by
Sorted by
Tagged with
6
votes
1answer
27 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 ...
4
votes
1answer
63 views

How do we determine whether a heuristic is better than another?

I am trying to solve a Maze puzzle using the A* algorithm. I am trying to analyze the algorithm based on different applicable heuristics. Currently, I explored the Manhattan and Euclidean distances. ...
2
votes
1answer
62 views

Understanding the proof that A* search is optimal

I don't understand the proof that $A^*$ is optimal. The proof is by contradiction: Assume $A^*$ returns $p$ but there exists a $p'$ that is cheaper. When $p$ is chosen from the frontier, assume $...
1
vote
1answer
27 views

How to transform a PDDL to search?

I have a question about search and planning: I still haven't understood the difference from the two, but they seem very similar to me; here is a question I am struggling with: "Having formulated a ...
2
votes
2answers
60 views

Why is a mix of greedy and random usually “best” for stochastic local search?

I read that a mix of "greedy" and "random" are ideal for stochastic local search (SLS), but I'm not sure why. It mentioned that the greedy finds the local minima and the randomness avoids getting ...
0
votes
0answers
42 views

Can AC-3 algorithm solve N-Queens problem?

I am building CSP NQueens solver and apply the AC-3 algorithm.But,the domain reduction doesn't occur and gets more search time.How does it happen?Is it a nature of AC-3 algorithm?
3
votes
1answer
25 views

Proof Branch and Bound always finds optimal path in a graph?

I've been studying Branch and Bound's graph algorithm and I hear it always finds the optimal path because it uses previously found solutions to find others, but I haven't been able to find a proof on ...
3
votes
1answer
94 views

Using graph searching to solve peg solitaire?

Problem: I've been reading research papers on how to solve a peg solitaire using graph searching, but all the papers kind of assume you know how to do the reduction(polynomial time conversion) from ...
1
vote
1answer
20 views

what are the similarity measure use for both continuous and categorical data?

I have searched but found that some similarity measures are for continuous data and some are for categorical data. But i want to know the similarity measures which are use for both data, continuous ...
1
vote
0answers
48 views

Is this ExpectiMinimax Tree correctly drawn?

I need help with ExpectiMinimax problem: Start a game. The first player flips a coin. The second player flips a coin. The first player decides if he wants to flip another coin. The second player ...
1
vote
1answer
85 views

How do I choose the search algorithm for a particular task?

How do I choose the search algorithm for a particular task? Which criteria should I take into account?
0
votes
2answers
57 views

How can the A* algorithm be optimized?

How can the A* algorithm be optimized? Any references that shows the optimization of A* algorithm are also appreciated.
2
votes
1answer
66 views

Why is informed search more efficient than uninformed search?

Why does informed search more efficiently finds a solution than an uninformed search?
8
votes
2answers
125 views

What is the difference between search and learning?

I came across an article, The Bitter Truth, via the Two Minute Papers YouTube Channel. Rich Sutton says... One thing that should be learned from the bitter lesson is the great power of general ...
1
vote
0answers
39 views

Is the minimum and maximum of a set of admissible and consistent heuristics also consistent and admissible?

Let's suppose I have a set of heuristics $S$ = {$h_1, h_2, ..., h_n$}. If all heuristics in $S$ are admissible, does that mean that a heuristic that takes the $MIN(S)$ (or $MAX$ for that matter) is ...
0
votes
1answer
57 views

How could we solve the TSP using an hill-climbing approach?

How could we solve the TSP using an hill-climbing approach?
1
vote
1answer
28 views

What are the common techniques one could use to deal with collisions in a Transposition Table?

Consider an iterative deepening search using a transposition table. Whenever the transposition table is full, what are common strategies applied to replace entries in the table? I'm aware of two ...
0
votes
0answers
20 views

In which situation hill climbing searching will be more appropriate?

There are various heuristic search algorithms, like hill climbing, greedy search, A* algorithm, but when it is best preferred to use hill climbing?
0
votes
1answer
51 views

How do I model the blocked N queens problem as a search problem?

The blocked N-queens is a variant of the N-queens problem. In the blocked N-queens problem, we also have a NxN chess board and N queens. Each square can hold at most one queen. Some squares on the ...
1
vote
2answers
332 views

Difference between Graph Search and Tree Search

First of all, there is a lot of misunderstanding about the Graph search and Tree search. The difference between these two is not about Graph and Tree. They have two different algorithms. You can find ...
3
votes
2answers
336 views

What is the difference between search and planning?

I'm studying Artificial Intelligence. A Modern Approach, Stuart Russell, Peter Norvig, specifically about search and planning arguments. I don't understand the difference between the two terms. I was ...
2
votes
0answers
131 views

How does DARTS compare to ENAS?

How does DARTS compare to ENAS? Which one is better or what advantages does they each have? Links: DARTS: Differentiable Architecture Search Efficient Neural Architecture Search via Parameter ...
4
votes
3answers
642 views

Can someone help me to understand the alpha-beta pruning algorithm?

I understand the minimax algorithm, but I am unable to understand deeply the minimax algorithm with alpha-beta pruning, even after having looked up several sources (on the web) and having tried to ...
2
votes
2answers
186 views

When should I use simulated annealing as opposed to a genetic algorithm?

What kind of problems is simulated annealing better suited for compared to genetic algorithms? From my experience, genetic algorithms seem to perform better than simulated annealing for most problems....
1
vote
1answer
45 views

What kind of search method is A*?

What kind of search method is A*? Explain to me with an example.
2
votes
2answers
493 views

What are examples of daily life applications that use simulated annealing?

In AIMA, 3rd Edition on Page 125, Simulated Annealing is described as: Hill-climbing algorithm that never makes “downhill” moves toward states with lower value (or higher cost) is guaranteed to be ...
4
votes
1answer
56 views

How do we find the length (depth) of the game tic-tac-toe in adversarial search?

When we perform the tic-tac-toe game using adversarial search I know how make a tree. Is there a way to find the depth of the tree; which level is the last level?
2
votes
1answer
122 views

Why does hill climbing algorithm only produce a local maximum?

Apparently, the hill climbing algorithm just produces a local maximum, and not necessarily a global optimum. It's stuck on a local maximum. Why does hill climbing algorithm only produce a local ...
0
votes
1answer
600 views

Why we use LIFO(Last in First Out) queue in depth first search?

As, we use FIFO(First In First Out) queue in breadth search algorithm but in depth first search we use LIFO.Why we use LIFO instead of FIFO in depth first search?
2
votes
1answer
1k 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?
0
votes
1answer
56 views

Is the parent cost in A* added in every extended child?

How do we determine the cost of the parent path to its child in A* ("A star") search?
3
votes
1answer
85 views

What is the basic purpose of local search methods?

I read about the hill climbing algorithms, the simulating annealing algorithm, but I am confused. What is the basic purpose of local search methods?
0
votes
1answer
364 views

Breadth first search VS recursive best first search?

What is the difference between breadth first search and recursive best first search ? How can I describe the key difference between them?
3
votes
2answers
2k views

What is an objective function?

Local search algorithms are useful for solving pure optimization problems, in which the aim is to find the best state according to an objective function. My question is what is the objective function ?...
9
votes
2answers
5k views

What are the limitations of the hill climbing algorithm and how to overcome them?

What are the limitations of the hill climbing algorithm? How can we overcome these limitations?
1
vote
1answer
1k views

How is simulated annealing better than hill climbing methods?

In hill climbing methods, at each step, the current solution is replaced with the best neighbour (that is, the neighbour with highest/smallest value). In simulated annealing, "downhills" moves are ...
2
votes
1answer
541 views

What are the differences between uniform-cost search and greedy best-first search?

What are the differences between the uniform-cost search (UCS) and greedy best-first search (GBFS) algorithms? How would you convert a UCS into a GBFS?
3
votes
1answer
6k 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?
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 ...
2
votes
2answers
133 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 ...
4
votes
2answers
4k views

How does the uniform-cost search algorithm work?

What is the uniform-cost search algorithm? How does it work? I would appreciate to see a graphical execution of the algorithm. How does the "frontier" evolve in the case of UCS?
2
votes
2answers
2k views

When should the iterative deepening search and the depth-limited search be used?

When should the iterative deepening search (IDS), also called iterative deepening depth-first search (IDDFS), and the depth-limited search be used?
2
votes
2answers
6k views

What are the differences between greedy best-first and the A* search algorithms? [duplicate]

What are the differences between greedy best-first and the A* search algorithms? How is A* better than the greedy best-first search algorithm?
0
votes
2answers
142 views

Any problems/games/puzzles in which exhaustive search cannot show that a solution does not exist?

Introduction Exhaustive search is a method in AI planning to find a solution for so called Constraint Satisfaction Problems. (CSP). That are problems which have some conditions to fulfill and the ...
3
votes
1answer
114 views

Transposition table is only used for roughly 17% of the nodes - is this expected?

I'm making a Connect Four game using the typical minimax + alpha-beta pruning algorithms. I just implemented a Transposition Table, but my tests tell me the TT only helps 17% of the time. By this I ...
2
votes
3answers
1k views

What heuristic to use when doing A* search with multiple targets?

The problem of multi-goal path planning was introduced in an ICRA paper in the year 2011: “Multi-goal planning is a task which arises in many robotics applications. It combines the challenging ...
2
votes
1answer
72 views

In the implementation of AI programming, does DFS always stop when it has found the leftmost solution?

I'm a fresh learner of AI. I was told that depth-first search is not an optimal searching algorithm since "it finds the 'leftmost' solution, regardless of depth or cost". Therefore, does it mean that ...
5
votes
2answers
341 views

More effective way to improve the heuristics of an AI… evolution or testing between thousands of pre-determined sets of heuristics?

I'm making a Connect Four game where my engine uses Minimax with Alpha-Beta pruning to search. Since Alpha-Beta pruning is much more effective when it looks at the best moves first (since then it can ...
0
votes
1answer
58 views

Which is more important, doubt or reinforcement?

Reinforcement? We hear much about reinforcement, which is, in my opinion a poor choice of a term to describe a type of artificial network that continues to acquire or improve its behavioral ...
4
votes
1answer
514 views

Exploration Strategies for Reinforcement Learning w/ Continuous Action Space

I'm building a deep neural network to serve as the policy estimator in an Actor-Critic reinforcement learning algorithm for a continuing (not episodic) case. I'm trying to determine how to explore ...