Process of minimax algorithm, Computer Engineering

Process of Minimax algorithm:

Our aim is just to write the best of best score on the top branches of the tree that player one can guarantee to score if he chooses that move. For this , we have to reached at starting at the bottom, we will write the final scores on unsccessively higher branches on the search tree until we reach the top. Moreover there is a choice of scores to write on a particular branch, we will imagine that player two will choose the card that minimises player one's final score or player one will choose the card which maximises his and her score. Our aim is to move on the proper scores all the way up the graph to the top, that all will enable player one to choose the card that can be leads to the most best guaranteed score for the overall game. If we try to write firstly the scores on the edges of the tree in the bottom two branches:

Now we want to move on the proper scores up to the next level of branches in the tree. Whenever, there is a choice. For example, mostly for the first branch on the second row, if we could write 10 either -12 or 8. Whenever this is our best guess about rationality comes into account. If we try write 10 there, this means that, supposing that player two has in reality chosen the 5, other of them player one can choose either 8 or 7. Choosing 7 would product in a score of 10 for player 1, choosing 8 would result in a score of -12. Clearly, player 1 would choose the 7, for that the score we write on this branch is 10.

344_Process of Minimax algorithm.png

Posted Date: 1/10/2013 4:59:51 AM | Location : United States







Related Discussions:- Process of minimax algorithm, Assignment Help, Ask Question on Process of minimax algorithm, Get Answer, Expert's Help, Process of minimax algorithm Discussions

Write discussion on Process of minimax algorithm
Your posts are moderated
Related Questions
Q. How is an instruction represented? Instruction is signified as a sequence of bits. A layout of an instruction is called as instruction format. Instruction formats are princi

The most expensive method of accessing Internet is to use leased lines which connect directly to the ISP. This will increase access rate to anywhere between 64 K and 1.5 Mbps, rely

write a program to find the area under the curve y=f(x) between x=a and y=b integrate y=f(x) between the limits of a and b. the area under a curve between two points can be found b

Why cant datareader be returned from a Web Services Method? Ans) Because datareader is not serializable.

Shared Memory Refers to the memory part of a computer system in which the memory can processed directly by any of the processors in the system. Distributed Memory Refer

Accessibility testing for web sites is a service that can give much more than the standard point-by-point testing methods of most automated services.


What are the fundamental steps in program development The basic steps in program development are as follows: a. Program coding, design and documentation. b. Preparation o

What are the methods for handling deadlocks?  The deadlock problem can be dealt with in one of the three ways:  a. Use a protocol to prevent or avoid deadlocks, make sure th

Give an account of modems used in data transfer. Modem: Modems are usually provided through network operators (Department of Telecommunication in India) or through vendors wh