Local search algorithm can be used to solve lots of classic prob

Local search algorithm can be used to solve lots of classic problems, such as SAT and $$N$$-Queen problems. Define the configuration of SAT to be $$X$$ = vector of assignments of $$N$$ boolean variables, and that of $$N$$-Queen to be $$Y$$ = positions of the $$N$$ queens in each column. The sizes of the search spaces of SAT and $$N$$-Queen are $$O(2^N)$$ and $$O(N^N)$$, respectively. ~@[](2)

答案：TRUE