General principles of pruning, Computer Engineering

Assignment Help:

General principles of pruning:

The general principles are such that:

1. Given a node N that can be chosen by player one, thus if there is another node, X, along any path, like that (a) X can be chosen by player two (b) X is on a higher level than N and (c) X has been shown to guarantee a worse score for player one than N, after then all the nodes with the same parent as N can be pruned.

2. Given a node N that can be chosen by player two, after then if there is a node X along any path just like that (a) player one can choose X (b) X is on a higher level so than N and (c) X has been shown to guarantee a better score for player one than N, after then all the nodes with the equal parent as N can be pruned.

As an exercise: in which one of these principles did we need in the M1 - M4 pruning example above? (For this type of puzzle to make it easy, I've written on the N's and X's).


Related Discussions:- General principles of pruning

Name the concepts of object oriented, Name the concepts of Object oriented ...

Name the concepts of Object oriented There are various concepts of object oriented analysis Abstraction, Encapsulation, Identity, Modularity, Hierarchy, Typin

Learning weights in perceptrons, Learning Weights in Perceptrons: Furt...

Learning Weights in Perceptrons: Furthermore details are we will look at the learning method for weights in multi-layer networks next lecture. Thus the following description o

Requirements for cache simulator, Using your cache simulator and using smal...

Using your cache simulator and using smalltex.din as your memory trace determine the total miss rate, compulsory miss rate, capacity miss rate, and conflict miss rate for the follo

Selecting integerated learning experiences, Q. Selecting integerated learni...

Q. Selecting integerated learning experiences? It is important that we select appropriate experiences for children, more so those that are from the child's world and emerge fro

Use of large register file, Generally the register storage is faster than c...

Generally the register storage is faster than cache andmain memory. Also register addressing uses much shorter addresses than addresses for cache and main memory. Though the number

What are superscalar processors, What are superscalar processors? Sever...

What are superscalar processors? Several instructions start implementation in the same clock cycle, and the processor is said to use multiple issue. Such processors are capable

Design issues of multi-threaded processors, Q. Design issues of Multi-threa...

Q. Design issues of Multi-threaded processors? To accomplish the maximum processor utilization in a multithreaded architecture, the subsequent design issues should be addressed

Explain about data registers, Q. Explain about data registers? The data...

Q. Explain about data registers? The data registers are used just for storing intermediate results or data and not for operand address calculation. Some dedicated address re

Describe data structures used during passes of assembler, Describe Data str...

Describe Data structures used during passes of assembler and their use. During passes of assembler, the Data structures define as: Pass 1 data base Input source pro

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