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

There no polymorphic-type response, Why is there no polymorphic-type respon...

Why is there no polymorphic-type response from a create() or find() method? Ans) The EJB Specification forbids this behavior, and the weblogic.ejbc compiler checks for this beha

Dynamic address translation - computer architecture, Dynamic address transl...

Dynamic address translation :  If, when executing an instruction, a CPU fetches an instruction located at a specific virtual address, or fetches data from a particular virtual

Explain about RISC pipelining, Q. Explain about RISC PIPELINING? Instru...

Q. Explain about RISC PIPELINING? Instruction pipelining is frequently used to increase performance. Let's consider this in context of RISC architecture. In case of RISC machin

Search mechanisms in prolog - artificial intelligence, Search mechanisms in...

Search mechanisms in Prolog We can utilize this simple Prolog program to describe how Prolog searches: president(X) :- first_name(X, georgedubya), second_name(X, bush). p

What is index register, What is index register? In index mode the effec...

What is index register? In index mode the effective address of the operand is formed by adding a constant value to the contents of a register. The register used might be either

Basic idea - learning decision trees, Basic idea: However in the above...

Basic idea: However in the above decision of tree which it is significant that there the "parents visiting" node came on the top of the tree. Whether we don't know exactly the

Describe the size and speed of scanners, Q. Describe the Size and Speed of ...

Q. Describe the Size and Speed of Scanners? Before actual scanning, a quick, low resolution scan known as pre-scan is made to preview the image and select scanning area. After

Where can i find conference information, Georg Thimm handles a webpage that...

Georg Thimm handles a webpage that lets you search for upcoming or past conferences in a range of AI disciplines.

Develop a program octal to hexadecimal, Q.  Develop a Menu driven program w...

Q.  Develop a Menu driven program with following menu: 1.  Octal to Decimal 2.  Octal to Hexadecimal 3.  Octal to Binary

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