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 advantages of threads over processes, What are the advantages...

What are the advantages of threads over processes? Some of the useful threads offer over processes includes: i)   It does not take more time to create and finished a new thr

What is input - output instructions, Q. What is Input - Output Instructions...

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

Multiple bus architecture - computer architecture, Multiple bus architectur...

Multiple bus architecture: One solution to the bandwidth restriction of a single bus is to simply add extra buses. Consider the architecture indicated in given figure that con

What are condition codes, What are condition codes? In many processors,...

What are condition codes? In many processors, the condition code flags are kept in the processor status register. They are either set are cleared by lots of instructions, so th

Explain about ALU organisation, ALU ORGANISATION An ALU performs simple...

ALU ORGANISATION An ALU performs simple arithmetic and logic operation as well as shift operations. Complexity of an ALU relies on the type of instruction set for that it has b

What are pooled tables, Normal 0 false false false EN-I...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Explain dynamic server creation briefly, Explain dynamic server creation br...

Explain dynamic server creation briefly. Dynamic Server Creation: If only one server handles one request at a time, each client should wait while the server fulfils the on

C program, Write a program to find the area under the curve y = f(x) betwee...

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

What is a spanning tree, What is a spanning Tree? A spanning tree is a ...

What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree

Illustrate when are intermolecular forces the strongest, Q. Illustrate when...

Q. Illustrate when are intermolecular forces the strongest? Answer:- Intermolecular forces dispersion and dipole-dipole and hydrogen bonds. These forces are feeble than ch

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