Tag: search

29 How to find the optimal number of neurons per layer? 2016-08-02T15:41:22.020

14 What is the difference between tree search and graph search? 2018-05-15T14:06:41.507

12 Are methods of exhaustive search considered to be AI? 2016-08-02T16:55:37.050

11 Why teaching only search algorithms in a short introductory AI course? 2016-12-20T15:44:15.303

10 Why is search important in AI? 2016-09-07T14:16:36.477

9 When to choose Stochastic Hill Climbing over Steepest Hill Climbing? 2017-09-10T13:09:04.427

9 What are the limitations of the hill climbing algorithm and how to overcome them? 2018-11-15T15:03:08.543

9 What is the difference between search and learning? 2019-04-13T18:28:22.733

9 Why is depth-first search an artificial intelligence algorithm? 2020-08-12T12:39:45.807

8 Are there local search algorithms that make use of memory to give better solutions? 2016-09-06T23:13:08.677

8 Why is A* optimal if the heuristic function is admissible? 2018-04-13T02:25:29.013

7 Why does Monte Carlo work when a real opponent's behavior may not be random 2018-06-29T14:31:57.610

7 What are the differences between A* and greedy best-first search? 2018-11-10T08:22:32.563

7 Can someone help me to understand the alpha-beta pruning algorithm? 2019-01-03T14:20:32.507

6 Why is the larger value, as opposed to the smaller one, chosen, in the hill climbing algorithm? 2017-10-19T14:03:09.607

6 Are leaf nodes included in the calculation of average branching factor for search trees? 2018-04-04T18:54:43.797

6 What is the fringe in the context of search algorithms? 2018-04-08T14:38:12.313

6 Are iterative deepening, principal variation search or quiescence search extensions of alpha-beta pruning? 2018-07-20T23:38:25.483

6 More effective way to improve the heuristics of an AI... evolution or testing between thousands of pre-determined sets of heuristics? 2018-08-16T23:33:09.813

6 How does the uniform-cost search algorithm work? 2018-11-03T10:13:52.817

6 Can two admissable heuristics not dominate each other? 2019-10-03T00:55:04.350

5 Illustration of Von Neumann's Minimax theorem in games? 2016-08-07T12:57:29.583

5 How does A* search work given there are multiple goal states? 2016-11-16T12:35:47.487

5 Is the 'direction' considered, when determining the branching factor in bidirectional search? 2017-01-14T19:58:36.810

5 What is the difference between local search and global search algorithms? 2017-09-23T09:19:23.177

5 How is iterative deepening A* better than A*? 2018-11-07T13:22:16.307

5 What is the difference between search and planning? 2019-01-25T10:34:07.857

5 A* is similar to Dijkstra with reduced cost 2019-05-24T13:06:30.177

5 How do we determine whether a heuristic is better than another? 2019-09-15T16:17:37.197

5 How to create an AI to solve a word search? 2019-11-10T20:00:07.917

4 How do I solve the knapsack problem using the hill climbing algorithm? 2017-03-22T19:19:13.410

4 Is there any website that allows you to choose an algorithm, code it and visualise how it works? 2018-01-30T14:53:22.540

4 How can I formulate the map colouring problem as a hill climbing search problem? 2018-02-20T00:11:50.153

4 Why is breadth-first search only optimal when the cost solution is a non-decreasing function? 2018-05-03T11:12:51.530

4 Exploration Strategies for Reinforcement Learning w/ Continuous Action Space 2018-08-03T22:41:54.930

4 Transposition table is only used for roughly 17% of the nodes - is this expected? 2018-10-14T09:05:08.993

4 What is the basic purpose of local search methods? 2018-11-19T16:06:10.987

4 How do I show that uniform-cost search is a special case of A*? 2018-11-26T14:59:20.600

4 How do we find the length (depth) of the game tic-tac-toe in adversarial search? 2018-12-07T07:01:46.120

4 What is the proof that the branch and bound algorithm always finds optimal path in a graph? 2019-05-19T19:52:06.153

4 If an heuristic is not admissible, can it be consistent? 2019-11-09T11:18:09.290

4 Why is it possible to eliminate this branch with alpha-beta pruning? 2020-01-29T20:33:27.783

3 How to find proper parameter settings for a given optimization algorithm? 2016-11-10T10:02:07.070

3 How does a google choose it's autocomplete solution 2017-01-15T14:03:44.797

3 How many iterations are required for iterative-lengthening search when step costs are drawing from a continuos range [ϵ, 1]? 2018-04-23T16:41:08.710

3 Can minimax be used when both players want to increase their score? 2018-06-14T21:22:41.780

3 Is a good evaluation function as good as any of the extensions of alpha-beta pruning? 2018-07-22T22:24:30.813

3 Does depth-first search always stop when it has found the leftmost solution? 2018-09-07T13:04:23.503

3 What are the differences between uniform-cost search and greedy best-first search? 2018-11-12T17:00:20.057

3 How is simulated annealing better than hill climbing methods? 2018-11-15T12:58:17.873

3 What is an objective function? 2018-11-16T15:40:10.037

3 Why does hill climbing algorithm only produce a local maximum? 2018-11-27T06:20:54.403

3 When should I use simulated annealing as opposed to a genetic algorithm? 2018-12-12T07:13:17.103

3 What are the common techniques one could use to deal with collisions in a Transposition Table? 2019-03-22T21:54:33.107

3 How do I find whether this heuristic is or not admissible and consistent? 2019-03-26T10:33:47.713

3 Using graph searching to solve peg solitaire? 2019-05-18T08:57:10.483

3 How to choose the weights for a linear combination of heuristic functions? 2019-10-17T12:27:56.897

3 A* and uniform-cost search are apparently incomplete 2019-11-24T07:24:26.767

3 Is the summation of consistent heuristic functions also consistent? 2020-02-28T15:25:48.877

3 What does the statement with the max do in the recursive best-first search algorithm? 2020-03-20T01:45:16.340

3 How can I formulate a nonogram problem as a constraint satisfaction problem? 2020-03-27T19:39:40.970

2 Adversarial search in the game '2048' 2018-04-13T16:15:42.577

2 AI to recognize keyword in a phrase within a context 2018-07-08T12:35:32.677

2 What heuristic to use when doing A* search with multiple targets? 2018-09-19T05:46:55.393

2 When should the iterative deepening search and the depth-limited search be used? 2018-11-02T07:23:32.690

2 What is the difference between the breadth-first search and recursive best-first search? 2018-11-17T13:22:49.690

2 How is the cost of the path to each node computed in A*? 2018-11-25T12:06:12.473

2 Why do we use a last-in-first-out queue in depth-first search? 2018-11-26T16:52:29.400

2 What are examples of daily life applications that use simulated annealing? 2018-12-11T06:01:05.643

2 What kind of search method is A*? 2018-12-12T01:45:17.587

2 How does DARTS compare to ENAS? 2019-01-12T06:27:04.450

2 Is the minimum and maximum of a set of admissible and consistent heuristics also consistent and admissible? 2019-04-10T13:53:28.567

2 Why is informed search more efficient than uninformed search? 2019-04-16T06:50:50.500

2 what are the similarity measure use for both continuous and categorical data? 2019-05-07T05:11:43.027

2 Why is a mix of greedy and random usually "best" for stochastic local search? 2019-05-31T06:06:22.240

2 Understanding the proof that A* search is optimal 2019-06-27T07:16:51.563

2 In the graph search version of A*, can I stop the search the first time I encounter the goal node? 2019-09-26T06:15:57.067

2 Understanding the pseudocode of uniform-cost search from the book "Artificial Intelligence: A Modern Approach" 2020-02-07T14:59:32.530

2 Why is the space-complexity of greedy best-first search is $\mathcal{O}(b^m)$? 2020-02-11T22:36:29.693

2 Agents meeting in a directed connected graph 2020-03-25T10:41:54.867

2 How can I apply the alpha-beta pruning algorithm to the "1-2 steal marbles" problem? 2020-04-16T02:21:24.563

2 What is the difference between hill-climbing and greedy best-first search algorithms? 2020-04-24T15:51:40.190

2 Wooden railway search problem AI 2020-05-10T13:44:52.740

2 Is A* with an admissible but inconsistent heuristic optimal? 2020-07-18T09:52:16.273

1 What should I do when the new generated state has bigger distance to the goal than the parent state? 2017-11-15T08:35:25.953

1 Can I prune the tree if alpha-beta pruning finds 10 to the left of the root node? 2017-11-23T16:38:53.243

1 Should the mutation be applied with the hill climbing algorithm? 2018-01-19T15:07:30.837

1 Any problems/games/puzzles in which exhaustive search cannot show that a solution does not exist? 2018-10-18T18:54:44.450

1 Does quiescence search even improve the minimax algorithm? 2019-01-05T21:24:54.670

1 How do I model the blocked N queens problem as a search problem? 2019-02-24T18:08:09.497

1 How do I choose the search algorithm for a particular task? 2019-04-23T04:12:28.513

1 Is this ExpectiMinimax Tree correctly drawn? 2019-04-27T05:28:22.510

1 Can AC-3 algorithm solve N-Queens problem? 2019-05-28T00:52:13.103

1 How to transform a PDDL to search? 2019-06-21T14:52:35.263

1 Why is the effective branching factor used for measuring performance of a heuristic function? 2019-11-24T11:01:08.023

1 FastDownward PDDL Planner Limitations 2020-02-03T20:08:07.170

1 How to report the solution path of a search algorithm on a graph? 2020-02-08T04:21:20.073

1 What are the properties of hill climbing? 2020-02-19T15:19:55.500

1 What does a consistent heuristic become if an edge is removed in A*? 2020-03-25T14:47:02.797