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

Describe the micro programmed control unit in detail, Describe the micro pr...

Describe the micro programmed control unit in detail. A micro programmed control unit is built around a storage unit is known as a control store where all the control signals a

Explain the term electronic data interchange (edi), Explain the term Electr...

Explain the term Electronic Data Interchange (EDI). Electronic Data Interchange (EDI) may be generally easy to understand as the replacement of paper-based purchase orders alon

8085 programs, what is the theory used to check whether a number is negativ...

what is the theory used to check whether a number is negative or positive?

Universal elimination, Universal Elimination: Here for any sentence, t...

Universal Elimination: Here for any sentence, there is A, containing a universally quantified variable, v, just for any ground term, g, so we can substitute g for v in A. Thus

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

Can a .net web application consume java web service, Can a .NET web applica...

Can a .NET web application consume Java web service? Yes Offcourse.Actually Webservices are independent  to language. It depends on WSDL and SOAP. so any single can develope t

What is verilog case 1, What is verilog case (1) ? wire [3:0] x; al...

What is verilog case (1) ? wire [3:0] x; always @(...) begin case (1'b1) x[0]: SOMETHING1; x[1]: SOMETHING2; x[2]: SOMETHING3; x[3]: SOMETHING4; endcase

What is software quality assuranc, Software QA includes the whole software ...

Software QA includes the whole software development PROCESS - improving and monitoring the process, making sure that any agreed-upon standards and processes are followed, and ensur

How to write good assembly programs, Preparation of writing the program ...

Preparation of writing the program 1.  Write an algorithm for your program closer to assembly language. For instance the algorithm for preceding program will be: get NUM1

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