Which of the following is true?
- Local Beam Search can be framed as a form of a natural selection algorithm where the candidates asexual.
- Minimax with alpha/beta pruning has `O(b^(m/2))` time complexity in the worst case, regardless of the order nodes
are expanded.
- Hill climbing with restarts and local beam search are two names for the same algorithm.