Computer Science · Artificial Intelligence
In a game-playing search tree using Alpha-Beta pruning, at which depths/levels can the α-β pruning cuts potentially be applied? (A) Root (0) level (B) Level 6 (C) Level 8 (D) Only at leaf nodes Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1(A) and (D) only
- 2(A), (B) and (C) only✓
- 3(A) and (B) only
- 4(B) and (C) only
Correct answer
(A), (B) and (C) only
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