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

Unix , how to write algorithum for unix progam

how to write algorithum for unix progam

Processor-memory interconnection network (pmin), Processor-Memory Interconn...

Processor-Memory Interconnection Network (PMIN) This is a switch that joined various processors to different memory modules. Connecting every processor to each memory module in

First in first out method, The First In First Out method assumes items of s...

The First In First Out method assumes items of stocks are issued in the same order as they are received. Thus the goods received first are assumed to be the first to be issued .Any

#computer architecture, explain common bus system with the help of neat dia...

explain common bus system with the help of neat diagram in basic computer.

Unix for multiprocessor system, The UNIX operating system for a multiproces...

The UNIX operating system for a multiprocessor system has a number of extra features as compared to normal UNIX operating system.  Let's first consider the design objectives of mul

Design goals of computer system, Design goals: The correct form of a c...

Design goals: The correct form of a computer system depends on the constraints and aim for which it was optimized. Computer architectures frequently trade off   cost, standard

Implementation of arithmetic circuits, Implementation of Arithmetic Circuit...

Implementation of Arithmetic Circuits for Arithmetic Micro-operation  An arithmetic circuit can be implemented by a number of full adder circuits or parallel adder circuits. F

What are the variations in a fast adder, a. Design a fast adder. What are t...

a. Design a fast adder. What are the variations in a fast adder? b. Define how the virtual address is changed into real address in a paged virtual memory system. Give an example

Don''t care states, The conflict between too hot and too cold or too slow a...

The conflict between too hot and too cold or too slow and too fast can be resolved using don't care states. Don't care states are used when i) the state of the output is not

Disadvantages of address translation, Disadvantages of Address translation:...

Disadvantages of Address translation: Disadvantages are following: A program that is too large to be held in a part needs some special design, that called overlay

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