AI_2

Which memory-restricted variant of A* algorithm stores nodes with the lowest f-values in a priority queue?

• SMA*

• IDA*

• D* Lite

• RBFS

Which variant of A* algorithm explores the search space by increasing the depth of the search at each iteration?

• SMA*

• IDA*

• D*Lite

• RBFS

Which of the following is a characteristic of a good heuristic function?

• It is always admissible

• It is always consistent

• It is both admissible and consistent

• None of the above

Which of the following is a disadvantage of using the hill climbing algorithm?

• It always finds the global maximum

• It can get stuck in a local maximum

• It requires a lot of memory

• None of the above

Which of the following is an advantage of using heuristic approaches in problem-solving?

• Guarantees the best solution

• Eliminates the need for human intervention

• Finds solutions that are not obvious

• Takes less time than other methods

Which of the following is true about the Best First Search algorithm?

• Best First Search always finds the optimal solution

• Best First Search always finds a feasible solution

• Best First Search may not find a solution if one does not exist

• Best First Search is guaranteed to find the solution in polynomial time

Which of the following is not a characteristic of Best First Search?

• Best First Search uses a heuristic function to guide the search

• Best First Search always expands the node with the lowest heuristic value

• Best First Search can be used for both informed and uninformed search problems

• Best First Search is a complete search algorithm

In the context of game playing, what does the term "minimax" refer to?

• A strategy for selecting the next move based on the worst-case scenario

• A strategy for minimizing losses

• A strategy for maximizing gains

• A strategy for selecting the next move based on the expected outcome of the game

In a two-player zero-sum game, what is the goal of the minimax algorithm?

• To maximize the payoff for both players

• To minimize the payoff for both players

•  To maximize the payoff for one player while minimizing it for the other

• To minimize the payoff for one player while maximizing it for the other

What is Alpha Beta Pruning used for in game theory?

• To determine the best move for a player in a game

• To reduce the complexity of a game tree search

• To determine the optimal strategy for a game

• To find the Nash equilibrium of a game