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
#quest2. Each time a defect gets detected and fixed, the reliability of a software production..

Explain a standard set of procedure for completing a local telephone call or call processing. Completing a local telephone call among two subscribers connected to the similar

Uninformed Search Strategies: To be able to undertake an unaware search, there is really important that the entire agent needs to know is the primary state, then the possible

Eliminating data hazards: Forwarding NOTE: In the following instance, computed values are in bold, whereas Register numbers are not. Forwarding involves adding output

Goals of this assignment: understanding networking and client server systems. In this assignment, you will write a simple http web server that handles conjunctive search queries (l

Q. Concurrently read exclusively write? It's one of the models based on PRAM. In this model, processors access the memory location simultaneously for reading whereas exclusivel

Q. In PRAM model steps required for executing an algorithm? Subsequent steps are performed by a PRAM model whenever executing an algorithm: i) Read phase: First the N proc


Explain Pre-emptive scheduling? Pre-emptive scheduling: in its approach, center processing unit can be taken away from a process if there is a require while in a non-pre-empt

Define the meaning of business-to-business. B2B (business-to-business): The consensus is universal: it is the priority; it is where the money is. It’s rather true; theref