考虑 8 皇后游戏。我们想使用爬山搜索来解决它。我们使用受到攻击的皇后对数作为启发式方法。下图显示了搜索中的初始状态。 如果我们想要移动后获得最佳的启发式值，我们应该移动哪个皇后（我们根据皇后所在的列来命名皇后，1、2、...、8）？单项选择题

题目图片

登录即可查看完整答案

我们收录了全球超50000道真实原题与详细解析,现在登录,立即获得答案。

类似问题

Take as heuristic the numbers in brackets. What would the solution path be if Hill Climbing approach was used?

Using the numbers in brackets as heuristic values, what is the search path from node A to node I using the Hill Climbing algorithm?

Consider the game of 8-queens. We want to solve it using hill climbing search. We use the number of pairs of queens under attack as the heuristic. The figure below shows the initial state in the search. Which queen should we move if we want the best heuristic value after the move (we name the queens after their column, 1,2,...,8)?

The implementation and loading phase of the Database Life Cycle (DBLC) involves _____.

更多留学生实用工具

加入我们，立即解锁 海量真题 与 独家解析，让复习快人一步！