For the usage within the uninformed algorithm, see the usage of the uninformed search algorithm to be used. It takes the state on which the goal test is supposed to be applied and the goal which is set by calling the GoalFunction before testing for the goal state. SuccessorFunction is an option that specifies a function to generate a list of possible new states from an existing state. In the search functions, it applies a set of transformation rules to various parts of the expression to generate a list of equivalent expressions. TransformationRules is an option for the various search routines.
Time is positive and temperature is nonnegative.
For SimulatedAnnealing, the cooling function should cool slowly for best results. The EvaluationFunction option specifies a function to return the cost of an expression. The value of the TransformationRules option indicates the rules to apply to the expression. By default, no rules are applied. The default successor function applies the rules at each level of the expression.