Example of pruning, Computer Engineering

Example of Pruning:

As an example, we are assume that the four choices for player one, there we are looking only two moves ahead 1 for player one and 1 for player two such as player are known as moves M1, M2, M3 and M4. In fact if we do a depth first search for player one's move, we can work out the score they are guaranteed just for M1 before even bearing in mind that move M2. Think that it turns out that player one is guaranteed to score 10 with move M1. We can just need this information to discard move M2 without checking all the potential for player two's move. Just for this instance, visualize that the first choice much possible for player two after M2 from player one technique that player one will score only 5 overall. In such for this case, we just know that the maximum player one can score with M2 is 5 or less. Naturally, player one won't choose this, is means that M1 will score 10 for them. We see that there's no point of to checking all the other potential of possibilities for M2. Whenever this can be seen in the following diagram (ignore the X's and N's for the time being):

1530_Example of Pruning.png


We that we could reject M2 straight away, because saving ourselves 3 nodes in the search space. We could reject M3 after we came across the 9, and in the end M4 turns out to be better than M1 for player one. In total, by proper using of alpha-beta pruning, we could say that we avoided looking at 5 end nodes out of 16 - around 30%. If there is the calculation to assess the scores at end-game states (or estimate them with an evaluation function) is computationally expensive, so this type of saving could enable a much more larger search. However, this kind of pruning can occur anywhere on the tree.

Posted Date: 1/10/2013 5:08:51 AM | Location : United States







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

Write discussion on Example of pruning
Your posts are moderated
Related Questions
how to implement a modified distribution method using c/c++

The linkage section is used to pass data from one program to one more program or to pass data from a PROC to a program.

A sorting method which uses the binary tree concept such that label of any node is larger than all  the labels in the sub trees, is called A Sorting method which uses the binar

What is the point of the REPLACING option of a copy statement? Ans) REPLACING permits for the similar copy to be used more than once in the similar code by changing the replac

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

Q. Show the Features of parallel virtual machine? Easy to install; Easy to configure; Multiple users each can use PVM concurrently; Multiple applications fro

Specifying Research Problems: In our agent terminology or in technique history, a problem to be solved is a specific and justified manner where the agent has starts with the b

Why do you think you are asked to do valuation given an array of discount rates? a.    Would it not be extra accurate to utilize, for intsnces , CAPM to calculate cost of equity

Create Perl scripts as required below: a) Create a script named select_by_attribute.pl that accepts the name of a LibML documentand the name of a particular attribute from the c

a) Input names of students from the user, terminated by "ZZZ", 0, 0, 0 and create a data file grades with records of the following form: Student (string), test1 (integer), test2 (i