Implement a search procedure based on the simulated annealing chapter in the constraint-based local search book. The goal is not to have a good search procedure here, rather have something that runs and serves as a base to iterate from.
One point of discussion could be the lack of tests in this PR. However, it would be necessary to mark methods 'virtual' to mock them. I think for this, going through the vtable is something we should avoid, but maybe that is some premature optimisation on my part. Please let me know what you think.
Implement a search procedure based on the simulated annealing chapter in the constraint-based local search book. The goal is not to have a good search procedure here, rather have something that runs and serves as a base to iterate from.
One point of discussion could be the lack of tests in this PR. However, it would be necessary to mark methods 'virtual' to mock them. I think for this, going through the vtable is something we should avoid, but maybe that is some premature optimisation on my part. Please let me know what you think.