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

What is a multitape tm, What is a multitape TM?  A  multi-tape  Turing ...

What is a multitape TM?  A  multi-tape  Turing  machine  having  of  a  finite  control  with  k-tape  heads  and k-tapes each tape is infinite in both directions. On a one mov

Explain the matlab mathematical function library?, This is a huge collectio...

This is a huge collection of computational algorithms ranging from elementary functions like sum, sine, cosine, and difficult arithmetic, to more sophisticated functions like matri

How a shift register can be used as a ring counter, Explain how a shift reg...

Explain how a shift register can be used as a ring counter giving the wave forms at the output of the flipflops. Ans: Shift Register as a Ring Counter: A Ring Counter is a

Explain protection mechanism, Explain Protection mechanism. Protection...

Explain Protection mechanism. Protection mechanism: The subsequent mechanisms are commonly utilized for protecting files having programs and data. (a) Access controls list

What is mini frame size where propagation speed is 200 m µs, A CSMA/CD bus ...

A CSMA/CD bus spans a distance of 1.5 Km. If data is 5 Mbps, What is minimum frame size where propagation speed in LAN cable is 200 m µs. Usual propagation speed in LAN cables

Effective branching rate - heuristic searches, Effective Branching Rate: ...

Effective Branching Rate: Assessing heuristic functions is an important part of "AI" research: a particular heuristic function may sound such a good idea, but in practice give

Algorithm and pseudocodes, develop an algorithm using pseudocode for comput...

develop an algorithm using pseudocode for computing cos(x) and sin(x). use a sentinel controlled while loop. use the series definition of e^+-jx

What is guard bits, What is guard bits? Guard bits are extra bits which...

What is guard bits? Guard bits are extra bits which are produced while the intermediate steps to yield maximum accuracy in the final results.

Methods to resolve collision during hashing., What are the two methods to r...

What are the two methods to resolve collision during hashing. The two methods to resolve collision during hashing are: a) Open addressing and b) Chaining.

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