Game Playing in Artificial Intelligence, a Computer Science fields, presented by Mwendwa Kivuva at Catholic University of Eastern Africa

1. Game Playing in Artificial Intelligence CMT310 --- Mwendwa Kivuva 1014638 Catholic University of Eastern Africa March 2009 [email_address] www.transworldafrica.com

8. Chess: 23-Mar-2009 Artificial Intelligence - CMT310 Kasparov 5’10” 176 lbs 34 years 50 billion neurons 2 pos/sec Extensive Electrical/chemical Enormous Height Weight Age Computers Speed Knowledge Power Source Ego Deep Blue 6’ 5” 2,400 lbs 4 years 32 RISC processors + 256 VLSI chess engines 200,000,000 pos/sec Primitive Electrical None 1997: Deep Blue wins by 3 wins, 1 loss, and 2 draws

21. Minimax Algorithm 23-Mar-2009 Artificial Intelligence - CMT310 function MINIMAX-DECISION( state ) returns an action inputs: state , current state in game v  MAX-VALUE( state ) return the action in SUCCESSORS( state ) with value v function MIN-VALUE( state ) returns a utility value if TERMINAL-TEST( state ) then return UTILITY( state ) v  ∞ for a,s in SUCCESSORS( state ) do v  MIN( v, MAX-VALUE(s) ) return v function MAX-VALUE( state ) returns a utility value if TERMINAL-TEST( state ) then return UTILITY( state ) v  -∞ for a,s in SUCCESSORS( state ) do v  MAX( v, MIN-VALUE(s) ) return v

24.  Pruning Example 23-Mar-2009 Artificial Intelligence - CMT310  3 MAX MIN =3 3 12 8 2 X X  2 14  14 5  5 2 =2 =3

26. Alpha-Beta Algorithm 1 MAX Ply 23-Mar-2009 Artificial Intelligence - CMT310 function ALPHA-BETA-SEARCH( state ) returns an action inputs: state , current state in game v  MAX-VALUE( state, - ∞ , + ∞ ) return the action in SUCCESSORS( state ) with value v function MAX-VALUE( state,  ,  ) returns a utility value if TERMINAL-TEST( state ) then return UTILITY( state ) v  - ∞ for a,s in SUCCESSORS( state ) do v  MAX( v, MIN-VALUE( s ,  ,  )) if v ≥  then return v   MAX(  , v ) return v

27. Alpha-Beta Algorithm II MIN Ply 23-Mar-2009 Artificial Intelligence - CMT310 function MIN-VALUE( state,  ,  ) returns a utility value if TERMINAL-TEST( state ) then return UTILITY( state ) v  + ∞ for a,s in SUCCESSORS( state ) do v  MIN( v, MAX-VALUE( s ,  ,  )) if v ≤  then return v   MIN(  , v ) return v

34. 23-Mar-2009 Artificial Intelligence - CMT310 To adapt hierarchical task-network planning techniques for use in BRIDGE GAME, ways for the planner to perform complex numeric calculations, plan for multiple agents, consult external information sources, and reason about uncertain information were developed. These same techniques are now proving useful in generating and evaluating manufacturing process plans Applications