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
Entropy - learning decision trees: Through putting together a decision of tree is all a matter of choosing that attribute to test at each node in the tree. Further we shall de

How are devices represented in UNIX? All devices are shown by files called special files that are located in /dev directory. Therefore, device files and other files are named a

According to the report, network 1 and network 2 are not able to reach network 3. As shown on OTBNetwork Topology above, OTB Inc. has 2 routing protocols running due transition iss

Explain the stack storage allocation model. In a stack-based allocation, all objects are allocated in last-in, first-out data structure and a stack. For example: Recursive subr

In a report with an LDB attribute, you do not have to explain how the information should be retrieved from the database tables, but only how the data should be shown on the screen.

Q. What is Input - Output Instructions? An I/O instruction is stored in memory of computer and is fetched as well as executed by processor producing an I/O-related command for

What are the essential elements of Electronic Data Interchange. The necessary elements of Electronic Data Interchange (EDI) are: The use of an electronic transmission me

Explain the working of Assembler? An assembler is the computer program for translating assembly language fundamentally a mnemonic representation of machine language into object

Ending transactions: Either side may request that a burst end after the present data phase. Simple PCI component that do not support multi-word bursts will always request this