Informed, Uninformed and Adversarial Search - AI - Data Science & Artificial Intelligence Previous Year Questions

Let \(h_1\) and \(h_2\) be two admissible heuristics used in A* search.
Which ONE of the following expressions is always an admissible heuristic?

Consider the following statement:
In adversarial search, \(\alpha-\beta\) pruning can be applied to game trees of any depth where \(\alpha\) is the __(m)__ value choice we have formed so far at any choice point along the path for the MAX player and \(\beta\) is the __(n)__ value choice we have formed so far at any choice point along the path for the MIN player.
Which ONE of the following choices of (m) and (n) makes the above statement valid?

Consider a state space where the start state is number 1. The successor function for the state numbered \(n\) returns two states numbered \(n+1\) and \(n+2\). Assume that the states in the unexpanded state list are expanded in the ascending order of numbers and the previously expanded states are not added to the unexpanded state list.
Which ONE of the following statements about breadth-first search (BFS) and depth-first search (DFS) is true, when reaching the goal state number 6?

Consider game trees Tree-1 and Tree-2 as shown. The first level is a MAX agent and the second level is a MIN agent. The value in the square node is the output of the utility function. For what ranges of \( x \) and \( y \), the right child of node \( B \) and the right child of node \( E \) will be pruned by alpha-beta pruning algorithm?

The state graph shows the action cost along the edges and the heuristic function \( h \) associated with each state. Suppose \( A^* \) algorithm is applied on this state graph using priority queue to store the frontier. In what sequence are the nodes expanded?

Which of the following algorithms is NOT an example of uninformed search?

Consider the game tree for a two-player turn-taking minimax game as shown in the figure. The value of a terminal node represents the utility of the game state if the game ends there. The numbers written next to the edges denote the strategies. There are two players MAX and MIN. At any particular state of the game, MAX prefers to move to a state of maximum value. On the other hand, MIN prefers to move to a state of minimum value. Suppose MAX starts the game at the root and has three strategies: 1, 2 and 3. Next, MIN plays and also has three strategies: 1, 2 and 3. The game ends there. Both players always take optimal strategies throughout the game. At the root, the best strategy for MAX is ________. (Answer in integer)