Simplify local search code

[mfeurer]

No description provided.

[LukasFehring]

LGTM;
Thank you for the contribution

[eddiebergman]

Did the order matter, as this removes ordering?

[LukasFehring]

@eddiebergman I thought since Python 3.7 sets are not unordered anymore, but are iterated deterministically.

[eddiebergman]

@LukasFehring that's dictionaries, as far as I'm aware, sets are ordered according to their hash values, which is dependant upon PYTHONHASHSEED

Python 3.12.8 (main, Jan 14 2025, 23:36:58) [Clang 19.1.6 ] on darwin
Type "help", "copyright", "credits" or "license" for more information.
>>> strings = ["a", "b", "c", "d", "e"]
>>> strings_set = set()
>>> for s in strings:
...     strings_set.add(s)
...
>>> print(list(strings_set))
['c', 'e', 'a', 'b', 'd']

[LukasFehring]

Ah, my mistake :)
Nevertheless, I just checked the code, and I believe this does not pose a problem in this case, as all of the starting points are later utilized in the local search hill climbing. If you find anything to the contrary, please let us know :)