Question 1
What is a heuristic function used for in Greedy Best-First Search?
Question 2
Which algorithm uses heuristic information to estimate the total path cost to the goal?
Question 3
In the context of AI search, what is a transition model?
Question 4
What makes the A* Search algorithm optimal?
Question 5
In which scenario would Breadth First Search (BFS) typically outperform Depth First Search (DFS)?
Question 6
In the context of AI search algorithms, what does the path cost function evaluate?
Question 7
Which search strategy ensures finding an optimal solution?
Question 8
What is the purpose of Alpha-Beta Pruning in adversarial search?
Question 9
What is the main focus of optimization in AI?
Question 10
How does the Depth First Search (DFS) algorithm explore nodes?
Question 11
Which of the following is an example of a task that AI can handle?
Question 12
What does the Minimax Algorithm aim to achieve in adversarial search?
Question 13
Which of the following correctly describes the initial state?
Question 14
Which element of a search problem specifies whether a state meets objectives?
Question 15
Which AI concept involves an agent perceiving and acting on its environment?