Computer Science · Artificial Intelligence
Match List-I with List-II in the context of Game Search Algorithms: List I (A) Minimax (B) Alpha-Beta pruning (C) Evaluation function (D) Cutoff test / depth limit List II (I) Prunes branches when α ≥ β (II) Chooses action with backed-up optimal utility under perfect play (III) Estimates value at non-terminal leaves (IV) Decides when to stop expanding and apply a heuristic
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A - III, B - IV, C - I, D - II
- 2A - IV, B - III, C - II, D - I
- 3A - I, B - II, C - IV, D - III
- 4A - II, B - I, C - III, D - IV✓
Correct answer
A - II, B - I, C - III, D - IV
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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Artificial Intelligence MCQs →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