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 single program multiple data, Q. What is Single Program Multiple Da...

Q. What is Single Program Multiple Data (SPMD) SPMD is in fact a "high level" programming model which can be built on any arrangement of previously described parallel programmi

Advantage of crc over simple checksum, Why can CRC detect more errors than ...

Why can CRC detect more errors than simple Checksum? There are two purposes a CRC can identify more errors than a simple Checksum. 1. Since an input bit is shifted by all th

What is stack addressing, Q. What is Stack Addressing? In this addressi...

Q. What is Stack Addressing? In this addressing technique operand is implied as top of stack. It isn't explicit however implied. It employs a CPU Register known as Stack Pointe

Computer representation for the negative integer, Everything stored on a co...

Everything stored on a computer can be represented as a string of bits. However, different types of data (for example, characters and numbers) may be represented by the same string

Explain about theta notation, Q. Explain about Theta Notation? Theta Θ...

Q. Explain about Theta Notation? Theta Θ Notation : The set Θ (g(n)) comprises all functions f(n) for that there exist positive constants c1,c2 such that f(n) is squeezed in b

C program, program to find minimum total number of shelfs

program to find minimum total number of shelfs

Create a system dynamic model, Easter Island is a small island (about 150 s...

Easter Island is a small island (about 150 square miles in area) in the Pacific Ocean about 2,000 miles from South America. In about 400 AD there was a small population of settlers

Water technology, Define end series and its application

Define end series and its application

What is the advantage of buffering, What is the advantage of buffering? Is ...

What is the advantage of buffering? Is buffering always effective? Justify your answer with help of an example. I/O buffer: One type of input-output requirement arises from d

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