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

Which technique is an encryption technique, Which technique is an encryptio...

Which technique is an encryption technique? Ans. Block cipher technique and also Steam cipher technique is an encryption technique.

Analog-to-digital conversion process, A stationary random displacement sign...

A stationary random displacement signal was digitised at 64 samples a second and analysed to obtain an auto-spectral density.  The signal was calibrated in mm units.  The frame siz

Granularity-concept of parallel execution and concurrent , Granularity ...

Granularity Granularity refers to the quantity of computation done in parallel relative to the dimension of the entire program. In parallel computing, granularity is a qualitat

Example application - canonical genetic algorithm, Example Application: ...

Example Application: There are many fantastic applications of genetic algorithms. Conceivably my favorite is their usage in evaluating Jazz melodies done as part of a PhD proj

How many instructions in a computer, Q. How many instructions in a Computer...

Q. How many instructions in a Computer? A computer can have a vast number of instructions and addressing modes. Older computers with the growth of Integrated circuit technolog

Show the liability of cpu in interrupt cycle, Q. Show the liability of CPU ...

Q. Show the liability of CPU in interrupt cycle? In the interrupt cycle the liability of CPU/Processor is to ensure whether any interrupts have happened checking presence of in

Meaning of every field in mips instruction, Q. Meaning of every field in MI...

Q. Meaning of every field in MIPS instruction? The meaning of every field in MIPS instruction is given below: op: operation code or opcode rs: First register source

Explain speedup performance and issues in pipelining, Speedup First, we...

Speedup First, we take the speedup factor which is we see how much speed up performance we achieve by pipelining. First we take ideal case for measuring the speedup. Let n b

What is driver software, Driver software is software that works as a transl...

Driver software is software that works as a translator among another program and some piece of hardware. In the software industry, there are commonly standard ways to do things. Th

What is a resource-allocation graph, What is a resource-allocation graph? ...

What is a resource-allocation graph? Deadlocks can be described more precisely in terms of a directed graph known as a system resource allocation graph. This graph having of a

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