The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+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 (98.5k points)
recategorized by | 699 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.1k 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
49,833 questions
54,800 answers
80,723 users