Computer Science · Artificial Intelligence
Arrange the following steps of the Min-Max Algorithm used in Game Playing AI in the correct sequence of execution: A. Evaluate the terminal states using the heuristic function B. Expand the game tree up to a certain depth C. Assign utility values to each node D. Choose the move leading to the optimal utility value.
- 1C → B → A → D
- 2B → C → A → D
- 3B → A → C → D✓
- 4A → B → C → D
Correct answer
B → A → C → D
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Artificial Intelligence?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Artificial Intelligence