论文标题
嵌套搜索与有限的差异搜索
Nested Search versus Limited Discrepancy Search
论文作者
论文摘要
有限的差异搜索（LDS）是一种流行的算法，用于搜索具有启发式启发式的状态空间以订购可能的动作。嵌套搜索（NS）是搜索具有相同启发式的状态空间的另一种算法。 NS花费更多的时间进行与最佳启发式竞争有关的举动，而LDS则花费更多的时间来进行最佳启发式运动。他们都在相同级别的搜索级别上使用相似的时间。我们在本文中提倡，通常像在NS中那样遵循最好的启发式竞赛比遵循LDS中的启发式方法更好。
Limited Discrepancy Search (LDS) is a popular algorithm to search a state space with a heuristic to order the possible actions. Nested Search (NS) is another algorithm to search a state space with the same heuristic. NS spends more time on the move associated to the best heuristic playout while LDS spends more time on the best heuristic move. They both use similar times for the same level of search. We advocate in this paper that it is often better to follow the best heuristic playout as in NS than to follow the heuristic as in LDS.
