Example of pruning, Computer Engineering

Assignment Help:

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.


Related Discussions:- Example of pruning

Explain criteria for selection of suitable intermediate code, Pass I of the...

Pass I of the assembler must also generate the intermediate code for the processed statements. Justify your answer. Criteria for selection of a suitable intermediate code form

Clocked sr flip flop, Clocked SR flip flop A clock pulse is a...

Clocked SR flip flop A clock pulse is a sequence of logic 0, logic 1, and logic 0 occuring on the CLK input. Time t n occurs before the clock pulse and time t n+1

Determine the use of loop instruction, Q. Determine the use of LOOP instruc...

Q. Determine the use of LOOP instruction? Program: This program prints the alphabets (A-Z) ; Register used: AX, CX, DX CODE SEGMENT ASSUME: CS: CODE.     MAINP:

How does computer know that overflow has happened, Q. How does computer kno...

Q. How does computer know that overflow has happened? Illustration: Add numbers 65 and 75 in 8 bit register in signed 2's complement notation.  Here expected result is

Existential construction - artificial intelligence, The English existential...

The English existential construction involves so-called there-sentences such as these: (1)  There is a dog in the yard (2)  There were no children at the party (3)  There

Characteristics of extreme unencoded micro-instructions, Q. Characteristics...

Q. Characteristics of extreme unencoded micro-instructions? 1. Two sources can be attached by respective control signals to a single destination; though only one of these sourc

What is a heap, What is a heap? A complete binary tree, every of whose ...

What is a heap? A complete binary tree, every of whose elements contains a value that is  greater than or equal to the value of every of its children is known a Heap

Algorithm to insert a key in b-tree, Algorithm to insert a key in B-tree is...

Algorithm to insert a key in B-tree is as follows: 1.  First search is completed for the place where the new record must be put. As the keys are inserted, they are sorted into

3D rotation, Magnify a triangle with vertices A = (0,0), B = (3,3) and C = ...

Magnify a triangle with vertices A = (0,0), B = (3,3) and C = (6,4) to twice its size in such a way that A remains in its original position.

How is it possible to make a module counter using n flipflop, How is it pos...

How is it possible to make a module 2 n counter using N-flipflops?  Name the two types of such counters. Ans: Module 2 n counter counts total 2 n distinguishable states w

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd