GATE DA · 2026 · DA
Question 30: data-science
Give it a try, then reveal the answer to check your work.
Question 30
DANAT1 markNeeds review
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)
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerEXPLORE & PRACTISE
Paper and topic context
See where this question comes from and choose what to practise next.
2026DA
GATE DA 2026 · Paper 1
Data Science and Artificial Intelligence · Original paper archive
- Section
- Data Science and Artificial Intelligence
- Question type
- Numerical answer (NAT)
- Marks
- 1 mark
Practise related topics
Explore more previous year questions using this question’s imported topic tags.
data science
GATE DA previous year questions
artificial intelligence
GATE DA previous year questions
computing
GATE DA previous year questions
ai
GATE DA previous year questions
Comments
Ask a question, share your approach, or help someone understand.
Log in to view the discussion
You’re not logged in. Log in or create an account to see discussions and add comments.