The Gateway to Computer Science Excellence
0 votes

________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution.

  1. Best first search
  2. Goal stack planning 
  3. Alpha-beta pruning procedure
  4. Min-max search 
in Algorithms by Boss (30.2k points)
recategorized by | 683 views

2 Answers

+4 votes

Answer : Alpha-beta pruning procedure

Reference : Explanation of Alpha-beta pruning procedure in Game Tree is Here 

by Boss (45.3k points)
Plz explain
+1 vote
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(Tic tac tac, Chess,Go etc).
by Active (1.9k points)
Nice explanation

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,647 questions
56,492 answers
100,706 users