Scribd
Upload
229 views8 pages

Games That Include An Element of Chance

Games that include an element of chance discusses chance-based games and strategies for them. It provides examples of chance-based scenarios and discusses how considering future information and averaging outcomes over multiple scenarios can influence optimal strategies. Deep Blue defeating Garry Kasparov in chess is mentioned as an example of an AI evaluating large numbers of possible moves. Arthur Samuel's early work developing a checkers-playing program that learned on its own through self-play is also summarized.

Uploaded by

Betsy Freda
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
229 views8 pages

Games That Include An Element of Chance

Games that include an element of chance discusses chance-based games and strategies for them. It provides examples of chance-based scenarios and discusses how considering future information and averaging outcomes over multiple scenarios can influence optimal strategies. Deep Blue defeating Garry Kasparov in chess is mentioned as an example of an AI evaluating large numbers of possible moves. Arthur Samuel's early work developing a checkers-playing program that learned on its own through self-play is also summarized.

Uploaded by

Betsy Freda
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 8

Games That Include An Element Of Chance

Expectiminmax
If node is terminal node or depth = 0 return the Utility(node) If adversarys turn A = -infinity For each child of node A = min(A,Expectminimax(child,depth-1)) Else if our turn A = infinity For each child of node A = max(A,max(child,depth-1)) Else if chance node A=0 For each child of node A = A + (Probability(child)) * ExpectminiMax(child, depth-1) Return A

Example

Position Evaluation & Complexity


Evaluation function must be a positive linear transformation O( b^m*n^m )
where n is distinct dice rolls

No Likely sequence of moves

Day 1: Road A leads to heap of gold; Road B leads to a fork: turn left and find a mound of jewels, turn right and get run over by a bus
Day 2: Road A leads to heap of gold; Road B leads to a fork: turn left and get run over by a bus, turn right and find a mound of jewels Day 3: Road A leads to heap of gold; Road B leads to a fork: guess correctly and find a mound of jewels, guess incorrectly and get run over by a bus

Its not unreasonable to take road B on the first two days.


It seems unreasonable to take road B on the third day. Averaging Over Clairvoyancy suggest to Take road B. Since it was optimal on the first two days one of those two conditions must hold on day three. Consider what information will be known at a point in time.

It is a good idea to move to a state that will give you more information about the environment.

Deep Blue
In 1997, Deep Blue defeated Garry Kasparov in six game exhibition match. Deep Blue was a parallel computer which evaluated 200 million possible moves per second. In June 1997 it was the 259th ,most powerful supercomputer. Evaluation function:
Over 8,000 parts, many designed for special positions. used a an "opening book" of about 4,000 positions and a database of 700,000 grandmaster games

Arthur Samuel
Developed a checkers program that learned its own evaluation function by playing itself thousands of times. Used rote learning (avoids understanding the game and instead focuses on memory) Computing equipment:
Had only 10,000 word memory magnetic tape for long-term storage a .000001-Ghz processor.

You might also like