'Is this considered a local search algorithm?
I read this online
Stochastic hill climbing is a local search algorithm that involves making random modifications to an existing solution and accepting the modification only if it results in better results than the current working solution.
So if I have strings of something and each character in the string corresponds go something. Example: a string of 1 and 0s. 1 means it has something 0 means it doesn’t.
If I randomly replace some of those characters and check to see if it’s a better solution (and replace it if needed) is this a local search?
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|