The Gateway to Computer Science Excellence
+2 votes

The strategy used to reduce the number of tree branches and the number of static evaluations applied in case of a game tree is

  1. Minmax strategy
  2. Alpha-beta pruning strategy
  3. Constraint satisfaction strategy
  4. Static max strategy
in Algorithms by Veteran (105k points)
recategorized by | 753 views
Is it in GATE syllabus?
@smsubham , No, It is the part of Artificial Intelligence which is not in GATE syllabus..
Ya part of AI.

1 Answer

+5 votes

Answer : Alpha-beta pruning strategy

Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. It is an adversarial search algorithm used commonly for machine playing of two-player games

Reference : Nptel

by Boss (45.4k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,240 answers
104,599 users