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

Design tables in html, In this portion you would see how to put tables in y...

In this portion you would see how to put tables in your web documents. It isn't that a table is simply a combination of rows and columns. If you have ever seen any table in an attr

Explain the types of computer architecture, Explain the types of computer a...

Explain the types of computer architecture Computer architecture can be divided into three main categories: Instruction Set Architecture, or ISA, is the image of a computing

Maximum number of nodes in a binary tree, The maximum number of nodes in a ...

The maximum number of nodes in a binary tree of depth 5 is 31 is the maximum number of nodes in a binary tree

Explain the typical functions of operating systems, List the typical functi...

List the typical functions of operating systems. Classical functions of operating system are given as: (1) Process management: A process is a program throughout execution.

What is independent process, What is independent process? A process is ...

What is independent process? A process is independent it cannot affect or be affected by the other processes implementing in the system. Any process does not share data with ot

Difference between shadow and override in programming, Overriding tell us o...

Overriding tell us only the methods, but shadowing tells us the entire element.

Write a program to find the area under the curve y = f(x) be, Write a progr...

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b

Explain the life cycle of a process, Explain the life cycle of a process ...

Explain the life cycle of a process Each procedure has a life cycle, which consists of execution, creation and termination phases of the procedure.  A method may create severa

Operating systems, Consider the state transition diagram of Figure 3.9b . S...

Consider the state transition diagram of Figure 3.9b . Suppose that it is time for the OS to dispatch a process and that there are processes in both the Ready state and the Ready/S

What are the exceptions encountered for fp operation, What are the exceptio...

What are the exceptions encountered for FP operation? The exceptions encountered for FP operation are overflow, underflow. /0, inexact and invalid values.

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