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

Determine the simulation factor- weather, Determine the simulation factor- ...

Determine the simulation factor- Weather Illustration of simulation is predicting weather (i.e. a weather forecaster). In this case we will consider what/how data is collected,

Limitations of experts system, 1. It is hard even for a highly skilled ex...

1. It is hard even for a highly skilled experts to abstract good situational assessment when he is under time pressure. 2. Expert systems perform well with specific t

Define seek time and latency time, Define seek time and latency time. ...

Define seek time and latency time.  The time taken by the head to move to the appropriate cylinder or track is known as seek time. Once the head is at right track, it must wai

What is replacement algorithm, What is replacement algorithm? When the ...

What is replacement algorithm? When the cache is full and a memory word that is not in the cache is referenced, the cache control hardware must decide which block should be del

Carry look-ahead adder and booth''s algorithm, Describe carry look-ahead ad...

Describe carry look-ahead adder? Ans: The input carry required by a stage is directly computed from carry signals obtained from all of the preceding stages i-1,i-2,.....0, rat

Change to palindrome, given a string S convert it to palindrome by doing ch...

given a string S convert it to palindrome by doing character replacement.convert S to palindrome with minimum character replacements

What is the accessibility testing, Accessibility testing for web sites is a...

Accessibility testing for web sites is a service that can give much more than the standard point-by-point testing methods of most automated services.

Explain what are the different hazards, There are situations, called hazard...

There are situations, called hazards that stop the next instruction in the instruction stream from implementing during its designated clock cycle. Hazards decrease the performance

Write about TSR, Write about TSR TPA also holds TSR (terminate and stay...

Write about TSR TPA also holds TSR (terminate and stay resident) programs which remain in memory in an active state until activated by a hot-key sequence or another event like

Parallelism conditions, Parallelism Conditions As discussed earlier, pa...

Parallelism Conditions As discussed earlier, parallel computing needs that the segments to be implemented in parallel must be free of each other. Thus, before implementing para

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