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

Define the term- analysis, Define the term- Analysis The analysis invol...

Define the term- Analysis The analysis involves some or all of the following stages: Fact finding - this is usually done in four ways. Understanding the current syst

Advantage and disadvantage of threaded binary trees, Advantage  1.     ...

Advantage  1.       By doing threading we neglect the recursive method of traversing a Tree , which makes use of stack and consumes many memory and time . 2.       The node

Concepts of an address and data, The heart of a computer is often one integ...

The heart of a computer is often one integrated circuit; one typical circuit is a 68Hc11 Microprocessor. Let us consider a typical 68Hc11 hardware design.           The mic

Processes vs threads, One might argue that in general processes are more ?e...

One might argue that in general processes are more ?exible than threads. For one thing, they can live in two different machines, and communicate via sockets; they are easy to spawn

Find a connection factory, Why do I get an exception when trying to find a ...

Why do I get an exception when trying to find a connection factory? Ans) The exception is regularly something like java.io.InvalidClassException or java.lang.NoClassDefFoundErro

Non-uniform memory access model (numa), Non-Uniform Memory Access Model (NU...

Non-Uniform Memory Access Model (NUMA) In shared memory multiprocessor systems, local memories can be joined with every processor. The group of every local memories form the gl

What is a snooping cache, DNS cache snooping is not a term the author just ...

DNS cache snooping is not a term the author just made up, it is called and discussed by some notable DNS execution developers, and a few interested DNS administrators have prob

Advantage of booth and restoring division algorithm, Describe the advantage...

Describe the advantage of using Booth algorithm? Ans:  a) It achieves efficiency in the number of additions needed when the multiplier has a few large blocks of 1's. b) It

Logic diagrams for same boolean expression, Q. Logic diagrams for same Bool...

Q. Logic diagrams for same Boolean expression? The expression F can be simplified using Boolean algebra. The logic diagram of simplified expression is drawn in fig (b)

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