Minimum possibility -minimax algorithm, Computer Engineering

Assignment Help:

Minimum possibility -minimax algorithm:

Finally, we want to put the scores on the top edges in the tree. So there is over again a choice. Whenever, in this case, we have to remember that player two is making the choices, and they will act in order to minimisation the score one of that player 1 gets. So there is, in the case when player one chooses the 3 card, player 2 will choose the 7 to reduces the score player 1 can get. So there is choice, we choose the minimum possibility of the three to put on the edges at the top of the tree as follows:

399_Minimum possibility.png

In the direction of choose the correct first card, well there would player one purely looks next to the topmost edges of the final tree and chooses the one with the highest score. In fact in this generally, there is alternate choosing the 7 will certification player one scores 10 in this game we can assuming that player one chooses according to such the minimax strategy just to move 2, but - importantly - making no assumptions worry for how player two will choose.


Related Discussions:- Minimum possibility -minimax algorithm

Explain bit-o-ring technique, Explain bit-O-Ring technique. The micro p...

Explain bit-O-Ring technique. The micro program represents that branches are not always made to a one branch address. This is a direct consequence of combining easy micro routi

DBMS, Difference between Paperbase and computer base system?

Difference between Paperbase and computer base system?

Magnetic storage - computer architecture, Magnetic storage - computer archi...

Magnetic storage - computer architecture: Magnetic storage uses different type of patterns of magnetization on a magnetically coated surface to store information. Magnetic sto

Define terms setup time and hold time violation, Define setup time and hold...

Define setup time and hold time, what will occur when there is setup time and hold tine violation, how to overcome it? For Synchronous flip-flops, we have particular requiremen

What is meaning of term byte stuffing, The term byte stuffing refers to: ...

The term byte stuffing refers to: The term byte stuffing consider as to data stuffing used along with character -oriented hardware.

Calculate grade of service in a particular excahange, In a particular excha...

In a particular exchange during busy hour 1200 calls were offered to a group of trunks, during this time 6 calls were lost. The average call duration being 3 minutes Calculate

What is the use of boot block, What is the use of boot block? For a com...

What is the use of boot block? For a computer to start running when powered up or rebooted it needs to have an initial program to run. This bootstrap program tends to be simple

Knowledge representation - artificial intelligence, Knowledge Representatio...

Knowledge Representation: To recap, we now have some characterizations of "AI", that when an "AI" problem arises, you will be able to put all into context exactly, find the co

Predicates in propositional model, Predicates in propositional model: ...

Predicates in propositional model: The predicates take a number of arguments in which for now we assume are ground terms and represent a relationship between those arguments t

What are threaded binary trees, What are threaded binary trees? A Threa...

What are threaded binary trees? A Threaded Binary Tree is a binary tree in which each node that does not have a right child has a THREAD (in real sense, a link) to its INORDER

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