Minimax algorithm - artificial intelligence, Computer Engineering

Assignment Help:

Minimax algorithm - artificial intelligence:

The minimax algorithm is so called because it assumes that you and your opponent are going to act rationally, so that if you will choose moves to try to maximise your final score and your opponent will choose moves to try to minimise your final score.

To demonstrate the minimax algorithm, it is needful to have a game whethere the search tree is fairly small. For that reason, we are going to invent the following very trivial game:

Take a pack of cards and deal properly out four(4) cards face up for this. Two players take it in turn to choose a card each until they have two each. The object is to choose two cards that they add up to an even number. The winner is the one with the largest even number n in the picture cards all count as 10 as show, and the winner scores n. If both players get the same even number, it is a draw, so they both score is seen zero.

Suppose the cards dealt are 3, 5, 7 and 8. We are concerned in which card player one should decide very first, and the mini-max algorithm can be used to decide this for us. To express this, we will draw the entire search tree and put the scores below the final nodes on paths which represent particular games.

1370_Minimax algorithm - artificial intelligence.png


Related Discussions:- Minimax algorithm - artificial intelligence

What are the process states, What are the Process states? By the course...

What are the Process states? By the courses of implementation, processes change state. Status of a process is express by its present activity. Dissimilar practical states of

What is parsing, a. Define parsing? Give difference among top down parsing ...

a. Define parsing? Give difference among top down parsing and bottom up parsing. b. Determine the self-relocating programs? Why self-relocating programs are less efficient then

Predicates in first-order logic sentences , Predicates in first-order logic...

Predicates in first-order logic sentences - artificial intelligence There are predicates first and foremost in first-order logic sentences. These are indications that some thin

Naïve bayes algorithm for text classification, Assignment 3: Naïve Bayes al...

Assignment 3: Naïve Bayes algorithm for text classification. First part: In this assignment, we will redo the task of classifying documents (assignment 2) using the same R

How many select lines will have a 16 to 1 multiplexer, How many select line...

How many select lines will a 16 to 1 multiplexer will have ?   Ans. For 16 to 1 MUX four select lines will be needed to select 16 (2 4 ) inputs.

Loosely coupled systems, Loosely Coupled Systems These systems do not d...

Loosely Coupled Systems These systems do not distribute the global memory because shared memory concept gives rise to the difficulty  of memory conflicts, which in turn slows d

Arc consistency, Arc Consistency: There have been many advances in how...

Arc Consistency: There have been many advances in how constraint solvers search for solutions (remember this means an assignment of a value to each variable in such a way that

Differentiate between qa and testing, Differentiate between QA and testing....

Differentiate between QA and testing. - Quality Assurance is more a stop thing, ensuring quality in the company and thus the product rather than just testing the product for so

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