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

De morgans laws, De Morgan's Laws : With continuing the relationship b...

De Morgan's Laws : With continuing the relationship between ^ and ? , we can also needs De Morgan's Law to rearrange sentences involving negation in conjunction with these con

An example of load-store optimization using expression trees, Give LOAD-STO...

Give LOAD-STORE optimization based on expression trees for the expression (A+B)/(C-D). LOAD-STORE optimization based on expression trees for the expression (A+B)/(C-D) is given

Labels in the sub trees, A sorting method which uses the binary tree concep...

A sorting method which uses the binary tree concept such that label of any node is larger than all  the labels in the sub trees, is called A Sorting method which uses the binar

Unit resolution, Unit Resolution: By assuming that we knew the sentenc...

Unit Resolution: By assuming that we knew the sentence as "Tony Blair is prime minister or may the moon is made of blue cheese", is true or we later found out that the moon is

Define compilers with high level programming language, Define Compilers wit...

Define Compilers with High Level Programming Language? All high-level programming language (except strictly interpretive languages) comes with a compiler. Effectively the compi

Explain meaning of each field format of icmp header, Give the format of ICM...

Give the format of ICMP header and explain meaning of each field. The format of ICMP header is given below: Internetwork Control Message Protocol (ICMP) ICMP H

Explain what is dtmf signalling, Explain what is DTMF signalling. Dual ...

Explain what is DTMF signalling. Dual Tone Multi Frequency (DTMF) was initially introduced in 1963 with 10 buttons into Western Electric 1500 -type telephones. Dual Tone Multi

Is there a macro recording interface in gimp, Not at this time. With GIMP b...

Not at this time. With GIMP based on GEGL, so that all changes are non-destructive, it will be much easier to execute this feature by just remembering all nodes in given range and

How to set a read or write watch point for a variable, By using Rwatch, Awa...

By using Rwatch, Awatch command in GDB we can set read or write watchpoint for a variable.

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