Questions tagged [hill-climbing]
For questions related to the family of algorithms called "hill climbing" (in the context of AI).
21
questions
2
votes
0answers
48 views
Which heuristic function should I use for the ColorShapeLinks game?
For learning purposes, I am trying to implement the minimax algorithm for the ColorShapeLinks game, which is similar to connect 4, except the fact that it combines both shape and color as the winning ...
1
vote
1answer
69 views
Questions about a research paper on salient region detection and segmentation
I am reading this paper in an attempt to recreate the salient region detection and segmentation model employed. I have the following questions pertaining to section 3 of the paper and I would highly ...
0
votes
1answer
74 views
Are hill climbing variations always optimal and complete?
Are hill climbing variations (like steepest ascent hill climbing, stochastic hill climbing, random restart hill climbing, local beam search) always optimal and complete?
0
votes
0answers
12 views
Need help understanding the solution to this randomized hill climbing quiz
This is a quiz on randomized hill climbing from Udacity's Machine Learning class.
The solution in green throws a value of 5.39 out of nowhere. How do we get 5.39 + v and 10 + v? The explanation is:
...
1
vote
1answer
2k views
How does best-first search differ from hill-climbing?
How does best-first search differ from hill-climbing?
1
vote
0answers
101 views
Can we solve an $8 \times 8$ sliding puzzle using hill climbing?
Can we solve an $8 \times 8$ sliding puzzle using a random-restart hill climbing technique (steepest-ascent)? If yes, how much computing power will this need? And what is the maximum $n \times n$ that ...
2
votes
1answer
3k views
What is the difference between hill-climbing and greedy best-first search algorithms?
While watching MIT's lectures about search, 4. Search: Depth-First, Hill Climbing, Beam, the professor explains the hill-climbing search in a way that is similar to the best-first search. At around ...
6
votes
2answers
188 views
How can I solve the zero subset sum problem with hill climbing?
I want to solve the zero subset sum problem with the hill-climbing algorithm, but I am not sure I found a good state space for this.
Here is the problem: consider we have a set of numbers and we want ...
0
votes
2answers
2k views
For which of the following reasons can Hill Climbing get stuck?
One-point Hill Climbing can get stuck due to which of the following phenomenon?
Local Maxima
Inadmissible heuristic
Ridges
Plateau
0
votes
1answer
743 views
How could we solve the TSP using a hill-climbing approach?
How could we solve the TSP using a hill-climbing approach?
3
votes
1answer
355 views
Why does the 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 ...
4
votes
1answer
117 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?
9
votes
2answers
14k 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?
3
votes
1answer
4k 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 ...
4
votes
2answers
2k views
How can I formulate the map colouring problem as a hill climbing search problem?
I have a map. I need to colour it with $k$ colours, such that two adjacent regions do not share a colour.
How can I formulate the map colouring problem as a hill climbing search problem?
1
vote
1answer
81 views
Should the mutation be applied with the hill climbing algorithm?
As far as I understand, the hill climbing algorithm is a local search algorithm that selects any random solution as an initial solution to start the search. Then, should we apply an operation (i.e., ...
1
vote
1answer
548 views
What should I do when the new generated state has bigger distance to the goal than the parent state?
I have implemented the hill climbing algorithm, with side away steps, which can increase the rate of success, because, when you don't have new generated states, you can go back to previous level and ...
6
votes
2answers
600 views
Why is the larger value, as opposed to the smaller one, chosen, in the hill climbing algorithm?
In the hill climbing algorithm, the greater value, compared to the current value, is selected, but I cannot understand why it takes the larger value instead of the smaller one. Why is that?
I greatly ...
9
votes
4answers
4k 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?
4
votes
1answer
2k views
How do I solve the knapsack problem using the hill climbing algorithm?
I need to solve the knapsack problem using hill climbing algorithm (I need to write a program). But I'm clueless about how to do it.
My code should contain a method called ...
8
votes
2answers
189 views
Are there local search algorithms that make use of memory to give better solutions?
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 ...
