Question

1
For which of the following will you always find the same solution, even if
you re-run the algorithm multiple times?
Assume a problem where the goal is to minimize a cost function, and every state in the state
space has a different cost
a. Steepest-ascent hill-climbing each time starting from a different starting state
b. Steepest-ascent hill climbing, each time starting from the same starting state
c. Stochastic hill-climbing, each time starting from a different starting state
d. Stochastic hill-climbing, each time starting from the same starting state
e. Both steepest-ascent and stochastic hill climbing, so long as you always start from
the same starting state
f. Both steepest-ascent and stochastic hill climbing, each time starting from a different
starting state
g. No version of hill climbing will guarantee the same solution every time​

Answer 1

Answer:

ಮೂಿೂ೮ಿಗಬಿಗಬದಹುುದಹದಹುಹುದದಹಿದ೭ುದ೭ುಬಮಗ್ಹೂಿಗ೬ಮಹೂ,ುರ

ು೭ುಹದನದಹದಹನುತಹತಹಮ

ನತುಹತರನತರನವಚಕಕನಚಚರನಚಹನನತರತರನತರನ

Explanation:

ಕಕಾತಾತಾಕ್