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 computer motherboard, If you open your computers case, the motherbo...

If you open your computers case, the motherboard is the flat, rectangular piece of circuit board to which the whole thing seems to connect to for one reason or one another. It'

#title.calomel electrode, explain the construction and working of calomel e...

explain the construction and working of calomel electrode

#title, what are the applications of microprogramming

what are the applications of microprogramming

Explain register marker, Explain Register marker. Register marker: St...

Explain Register marker. Register marker: Strowger selectors doing searching and counting. Conversely, the crossbar switch has no 'intelligence'. Something external to the

Programming project, l need a help for my project pllz:) Write a program th...

l need a help for my project pllz:) Write a program that will simulate ATM machine. The Program should prompt the user to enter a valid PIN password number of 5 digits (PIN: 12312)

Define class np, Define class NP. Problems that can be solved in polyn...

Define class NP. Problems that can be solved in polynomial time by a nondeterministic TM. Contains all problems   in P and some problems possibly outside P.

Multiple program multiple data, Like SPMD, MPMD is actually a "high level" ...

Like SPMD, MPMD is actually a "high level" programming model that can be built upon any combination of the previously mentioned parallel programming models. MPMD applications ty

Write heterogeneous functions, Write "heterogeneous" functions If a pro...

Write "heterogeneous" functions If a program uses simulated, dynamically allocated multidimensional arrays, it becomes possible to write "heterogeneous" functions which don't h

Logic diagrams for same boolean expression, Q. Logic diagrams for same Bool...

Q. Logic diagrams for same Boolean expression? The expression F can be simplified using Boolean algebra. The logic diagram of simplified expression is drawn in fig (b)

Describe set-associative mapping, Q. Describe Set-Associative Mapping? ...

Q. Describe Set-Associative Mapping? A third type of cache organization known as set-associative mapping is an improvement on direct mapping organization in that every word of

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