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
Any identity or equality in Boolean algebra, suchas de Morgan's Theorem can be proved usingthe method of perfect induction. 1. All combinations of variables are written down.

you will implement a second-order low-pass filter using the finite difference method. The finite difference method is a useful mathematical method that is used to numerically solve

Since the term artificial intelligence was defined in the 1950s, experts have disagreed about the difference between natural and artificial intelligence. Can computers be pro

Q. Define Logical data as operand data type? Every word or byte is treated like a single unit of data. Whenever an n-bit data unit is considered as comprising n 1-bit items of

If quicksort is so quick, why bother with anything else? If bubble sort is so bad, why even mention it? For that matter, why are there so many sorting algorithms?

Which of the memories stores the most number of bits ? Ans. most number of bits stores in 32M x 8 As 2 5 x 2 20   = 2 25 Therefore 1M = 2 20 = 1K x 1K = 2 10 x 2 10

What are the Process states? By the courses of implementation, processes change state. Status of a process is express by its present activity. Dissimilar practical states of

How many methods used to control traffic flowing into and out of the network by firewall? Firewalls utilize one or more of three ways to control traffic flowing into and out of

Q. Versions of small computer systems interface? SCSI-1 calls for a cable with 8 data wires plus one for parity. SCSI-2 allows use of multiple cables to support 16- or

Rectifier output with fitters: When half-wave and full-wave rectification suffice to deliver a type of DC output, neither produces constant-voltage DC (direct current). To gen