Von Neuman (Min-Max theorem)
of 28
description
Claude Shannon (finite look-ahead). Chaturanga, India (~550AD) (Proto-Chess). Von Neuman (Min-Max theorem). Donald Knuth ( a-b analysis). John McCarthy ( a-b pruning). Wilmer McLean. The war began in my front yard and ended in my front parlor. - PowerPoint PPT Presentation
Transcript of Von Neuman (Min-Max theorem)
PowerPoint Presentation
Von Neuman(Min-Max theorem)
Claude Shannon(finite look-ahead)
Chaturanga, India (~550AD)(Proto-Chess)
John McCarthy (a-b pruning)
Donald Knuth(a-b analysis)
1
Wilmer McLeanThe war began in my front yard and ended in my front parlor
Deep Thought: Chess is easy for but the pesky opponentSearch: If I do A, then I will be in S, then if I do B, then I will get to SGame Search: If I do A, then I will be in S, then my opponent gets to do B. then I will be forced to S. Then I get to do C,..
Snakes-and-ladders is perfect information with chance think of the utter boringness of deterministic snakes and ladders Not that the normal snakes-and-ladders has any real scope for showing your thinking power (your only action is dictated by the diceso the dice can play it as a solitaireat most they need your hand..). Kriegspiel(blind-fold chess)Snakes & Ladders?4
5
Searching Tic Tac Toe using MinmaxA game is consideredSolved if it canbe shown thatthe MAX playerhas a winning(or at least Non-losing)Strategy
This means that the backed-upValue in theFull min-max Tree is +ve6
7
8
2
