A genetic algorithm is a variant of stochastic beam search, in which successor states are generated:遗传算法是随机束搜索的一个变体，其中后继节点的生成是由：
A genetic algorithm is a variant of stochastic beam search, in which successor states are generated:遗传算法是随机束搜索的一个变体，其中后继节点的生成是由：
A.by combining two parent states rather than by modifying a single state.组合两个双亲状态而不是修改单一状态。
B.by modifying a single state rather than by combining two parent states.组合两个双亲节点而不是修改单一节点。
C.by combining two parent nodes rather than by modifying a single node.组合单一状态而不是组合两个双亲状态。
D.by modifying a single node rather than by combining two parent nodes.组合单一节点而不是组合两个双亲节点。
正确答案：by combining two parent states rather than by modifying a single state.组合两个双亲状态而不是修改单一状态。
- 上一篇：Keeping just one node in memory might seem to be an extreme reaction to the problem of memory limitations. Local beam search keeps track of:在内存中仅保存一个节点似乎是对内存限制问题的极端反应。局部束搜索保持：
- 下一篇：Hill climbing search is sometimes called greedy local search because it grabs a good neighbor state without thinking ahead about where to go next. Unfortunately, it often gets stuck for the three reasons:爬山搜索有时也被称为贪婪局部搜索，因为它只顾抓住一个好的邻接点的状态，而不提前思考下一步该去哪儿。它在