Figure 4.5 - SIMULATED-ANNEALING describes an optimization algorithm that is supposed to return a state, as per the first line of the function declaration. The rest of the implementation, however, goes on to return a node instead of its state. I am not certain about the reason behind this, but I think the pseudocode should change to match the function declaration (and the standard format of other optimisation functions in the book, such as HILL-CLIMBING). I am unsure about how to propose this as an edit to the pseudocode (or even whether I should do so or not).
Figure 4.5 - SIMULATED-ANNEALING describes an optimization algorithm that is supposed to return a state, as per the first line of the function declaration. The rest of the implementation, however, goes on to return a node instead of its state. I am not certain about the reason behind this, but I think the pseudocode should change to match the function declaration (and the standard format of other optimisation functions in the book, such as HILL-CLIMBING). I am unsure about how to propose this as an edit to the pseudocode (or even whether I should do so or not).