Correct answer: 2
Searching into its own knowledge base for solutions

Whenever an AI-based agent is confronted by a problem, it first looks into its database for a solution or similar type of problem. Then it looks at other places like perceiving the environment, applying logic, etc.

正確答案：2
搜索自己的知識庫以尋求解決方案

每當基于AI的代理遇到問題時，它都會首先在其數據庫中查找解決方案或類似類型的問題。 然后，它著眼于其他地方，例如感知環境，應用邏輯等。

Correct answer: 1
Only iv.

In the best first search, which is also known as the heuristic search, the agent picks up the best node based upon the heuristic value irrespective of where the node is.

正確答案：1
只有iv。

在最佳的第一搜索(也稱為啟發式搜索)中，代理基于啟發式值選擇最佳節點，而與節點的位置無關。

Correct answer: 4
All of the above

All the mentioned options are the properties that differentiate a heuristic search from other searches.

正確答案：4
上述所有的

所有提到的選項都是將啟發式搜索與其他搜索區分開的屬性。

Correct answer: 2
The Depth First Search (DFS)

In DFS, the search first begins from the root node and the first one of the child node’s sub-tree is completely traversed. That is, first all the one-sided nodes are checked, and then the other sided nodes are checked.

正確答案：2
深度優先搜索(DFS)

在DFS中，搜索首先從根節點開始，子節點的子樹中的第一個子樹被完全遍歷。 即，首先檢查所有單側節點，然后檢查另一側節點。

Correct answer: 1
True

If we want to optimize our algorithm, we must take care of both the time limit as well as the cost that occurred in our searching. The lesser they are, the more efficient our algorithm is.

正確答案：1
真正

如果要優化算法，則必須考慮時間限制以及搜索中發生的成本。 它們越小，我們的算法就越有效。