Alpha-beta pruning, Computer Engineering

Alpha-beta pruning:

Thus we can prune via the alpha-beta method, it makes means to perform a depth-first search requiring the minimax principle. Just compared to a breadth first search, is mostly just a depth first search will get to goal states quicker, so after then this information can be used to determine the scores guaranteed for a player at particular board states, that in turn is unavoidable to perform alpha-beta pruning. Or we say that a game-playing agent used a breadth first search instead, after then only right at the end of the search would it reach the goal states and begin to perform minimax calculations. Thus there, the agent would miss much potential to performed pruning.

Using a depth first search and alpha-beta pruning is fairly sensitive to the order in which we just trying operators in our search. For example as we got in this, if we had chosen to look at move M4 first, after then we would have been able to do more pruning, due to the higher minimum value (11) from in such branch. Might be, it is worth spending some time working out which one best to order a set of operators, so after this will greatly increase the amount of pruning can mostly occur in there.

It's observable that a depth-first minimax search with alpha-beta pruning search dominates mini-max search alone. Moreover, If there is the effective branching rate of a normal minimax search was b, then utilising.

An alpha-beta pruning will reduce this range to √b(under root of b). In this chess, hence we say after that the effective branching rate reduces from around 35 to around 6, denotation that alpha-beta search can look further moves ahead instead of a normal mini and max search among cutoff .

Posted Date: 1/10/2013 5:11:07 AM | Location : United States







Related Discussions:- Alpha-beta pruning, Assignment Help, Ask Question on Alpha-beta pruning, Get Answer, Expert's Help, Alpha-beta pruning Discussions

Write discussion on Alpha-beta pruning
Your posts are moderated
Related Questions
Draw an expression tree for the string. f + (x+y) *((a+b)/(c-d)). Indicate the register requirement for each node and list out the evaluation order for the expression tree. For

Functioning of ROLAP happens concurrently with relational databases. Data and tables are stored as relational tables. To hold new information or data new tables are formed. Functio

This is a small window that is demanding your attention. You must respond before you can carry on using the program that shown the dialog box. A dialog box does not have a minimize

Q. Define Hyperlinks? Hyperlinks, or links are one of the most significant characteristics of web pages. A link moves us from current page to a destination which is specified i

What is known as multiphase clocking? When edge-triggered flip flops are not used, two or more clock signals may be required to guarantee proper transfer of data. This is calle

Q. How to load DOS from Floppy Disk? If DOS is not setup on the Hard Disk of your PC, or you want to load DOS from the Floppy disk drive due to any reason, follow these steps:

A red and blue car were involved in a head-on collision. The red car was at a standstill and the blue car was possibly  speeding. Eye witness video recorded suddenly following the

Differentiate between Batch Operating System and Time Sharing Operating System? Batch operating systems : A batch is a sequence of jobs. Such batch is submitted to batch proce

Design a 1-bit full adder: Verify your design Use the 1-bit full adder to build a 4-bit adder with Ci=0 Verify: 1 + 4, and 9 + 9 Sram design: Cell: p - 0.5/0.045;

Q. Explain the properties of Hypercube? Properties of Hypercube: Hypercube is both edge and node symmetric. The labels of any two neighbouring nodes vary in exactl