Appendix. Mathematical Theorems
|
|
- Scot Patterson
- 5 years ago
- Views:
Transcription
1 Appendix Mathematical Theorems This appendix introduces some theorems required in the discussion in Chap. 5 of the asymptotic behavior of minimax values in Pb-game models. Throughout this appendix, b is an integer greater than 1. Theorem 1. In the interval (0, 1) there is exactly one root of the equation (A) This root is denoted by W b Proof. Consider the function f(x) = x b + x -1. Since f is strictly monotonically increasing in the interval [0,1], and sincef(o) = -1 andf(l}= 1, there is exactly one zero in (0, I). 0 Theorem 2. The sequence { W b } with all possible b's is a strictly increasing sequence and limb"" 00 Wb= 1. Proof. Note that 0< Wb< 1 and that Wb= 1- Wbb for each b> 1. Let b<c. The assertion Wb;;::: We would lead to the following contradiction: Wb= 1-(Wb)b:s; 1-(Wl< 1-(WeY= We' Therefore, {Wb} is strictly increasing. Let limb... OOWb= W. Then Wb < W:s; 1 for all b. If W < 1, then Wbb < W b for all band limb... OOWbb=O. This leads to another contradiction: limb"" 00 Wb=limb... oo(1- Wbb) = 1-0= 1. o Theorem 3. Wb is also a root of the equation: (B) Proof. From Wbb+ Wb-1 =0, we have 1- Wb b = Wb and 1-(1- Wbb)b= 1- Wb b = Wb. o
2 Theorem 4. Wb is the only root of the equation (B) in the interval (0, 1). Appendix 101 Proof Consider the function y = 1-(1-Xb)b - x. Then y has 3 different zeros, 0, Wb, and 1. If there were another zero in (0, 1) then the derivative of y' would have at least three zeros, and y" would have at least two zeros in (0, 1). However, since y" =b2(b-1)xb- 2(1-Xb)b-2(1_(b+ 1)xb), y" has only one zero in (0, 1). Therefore, y has only one zero in (0, 1). 0 Theorem 5. The following two inequalities hold: and 1-(1-Xb)b<X for O<x< Wb Proof Let Since y' = b2xb- 1(1_ Xb)b-l -1, y'(o) and y'(1) are negative, and thus y is decreasing at 0 and 1. The asserted inequalities now come from the fact that y is zero only at 0, Wb and 1. 0 Let p be any value in the interval [0, 1]. For any integer b> 1, define P n recursively as follows: Po=P, Pn= 1-(1-Pn-/t for Theorem 6. If P = Wb, then P n = Wb for all n; otherwise, and limn-+oopn=o for O::;p< Wb, limn-+ oopn= 1 for Wb<p::; 1. n>o. Proof The first assertion in this theorem comes directly from Theorem 3. Consider next the second assertion. For the cases when p=o or 1, the conclusions come immediately from the definition. Now suppose O<p< Wb. Consider the function Then f(x) = 1-(1-Xb)b. and each P n is positive. From Theorem 5, P n is strictly decreasing. Let W=limn-+ooPn Then 0::; W < Wb. W is a fixed point off, and from Theorem 4 we have W = o. The assertion for the other case (i.e., Wb<p< 1) can be proved similarly. 0
3 References Barr A, Feigenbaum EA (eds) (1981) The handbook of artificial inteliigence, vol!. WilIiam Kauffmann, Los Altos, CA Baudet GM (1978) On the branching factor of the alpha-beta pruning algorithm. Artificial IntelIigence 10(2): Beal D (1980) An analysis of minimax. In: Clarke MRB (ed) Advances in computer chess 2. Edinburgh University Press, Edinburgh, pp Beal D (1982) Benefits of minimax search. In: Clarke MRB (ed) Advances in computer chess 3. Pergamon, Oxford, pp Bratko I, Gams M (1982) Error analysis of the minimax principle. In: Clarke MRB (ed) Advances in computer chess 3. Pergamon, Oxford, pp 1-15 Chung KL (1974) A course in probability theory, 2nd ed Academic Press, New York Dresher M (1981) The mathematics of games of strategy: theory and application. Dover Publications, New York Knuth DE, Moore RW (1975) An analysis of alpha-beta pruning. Artificial IntelIigence 6(4): Nau DS (1980) Decision quality as a function of search depth of game trees. TR -866, Computer Science Department, University of Maryland Nau DS (1981) An investigation of the causes of pathology in games. TR-999, Computer Science Department, University of Maryland Nau DS (1983a) Pathology on game trees revisited, and an alternative to minimaxing. Artificial IntelIigence 21: Nau DS (1983b) Game graph structure and its influence on pathology. TR-1246, Computer Science Department, University of Maryland Nau DS, Purdom P, Tzeng C-H (1986) An evaluation of two alternatives to minimax. In: Kanaland LN, Lemmer JE (eds) Uncertainty in artificial inteliigence. North-HolJand, Amsterdam, pp Nilsson N (1980) Principles of artificial intelligence. Tioga, Palo Alto, CA Pearl J (1980) Asymptotic properties of minimal trees and game-searching procedures. Artificial IntelIigence 14: Pearl J (1981) Heuristic search theory: a survey of recent results. In: Proc IJCAI 7, Vancouver, British Columbia, Canada, pp Pearl J (1983) On the nature of pathology in game searching. Artificial IntelIigence 20: Pearl J (1984) Heuristics: inteliigent search strategies for computer problem solving. Addison-Wesley, Reading, MA Pohl I (1970) First results on the effect of error in heuristic search. In: Meltzer B, Michie D (eds) Machine inteliigence 5. American Elsevier, New York, pp Reibman AL, BaIJard BW (1983a) Non-minimax search strategies for use against faliible opponents. In: Proceedings of the national conference on artificial inteliigence AAAI-83. William Kaufmann, Los Altos, CA, pp Reibman AL, BaIJard BW (1983b) The performance of a non-minimax search strategy in games with imperfect players. CS , Duck University, Durham, NC Samuel AL (1959) Some studies in machine learning using the game of checkers. IBM Journal R&D 3: Slagle R, Dixon J (1970) Experiments with M & N tree-searching programs. Communication of ACM 13:
4 References 103 Tzeng C-H (1984) A mathematical model of heuristic game playing. In: Laubsch J (ed) GWAI-84. Springer-Verlag, Berlin, Heidelberg pp Tzeng C-H, Purdom P (1983) A theory of game trees. In: Proceedings of the national conferences on artificial intelligence AAAI-83. William Kaufmann, Los Altos, CA, pp Tzeng C-H, Purdom P (1986) Estimation of minimax values. In: Ras ZW, Zemankova M (eds) Proceedings SIGART international symposium on methodologies for intelligent systems. ACM, New York, pp von Neumann J, Morgenstern M (1946) Theory of games and economic behavior. Princeton University Press, Princeton, NJ
5 Subject Index Additivity 32 countable 32 finite 32 Adversary 2 Almost everywhere 38 Alpha-beta procedure 13, 14, 16,20, 59 AND 48, 49, 50 Asymptotic behavior 46 Average 34 Average propagation 26 Back-up process 5, 18, 20 Backgammon 7 Ballard 25, 26 Barr 21 Baudet 17 Baye's rule 37 Bayesian statistics 37 Bea1 4, 22, 98 Binomial distribution 82 BLACK 10 Bonus function 25 Boolean operators 48 Borel field 29, 30, 65 product 35 total 29 trivial 29, 38 Borel set linear 33 Branching factor 45, 81 Bratko 98 Bridge 7 Checker 98 Chess 7,98 Chung 28,34 City-block distance 3, 4 Combinatorial explosion 3 Conditional expectation 37, 38 Conditional probability 36, 82, 91, 93 Control strategy 3 Control system 1 Countable additivity 32 Cutoff alpha 15 beta 15 lower 15 upper 15 Decision behavior 40 Decision making 4, 64, 68 Decision model 68, 69 Decision problem 68 Decision quality 68, 70, 71, 72 Decision strategy 68 De Morgan's law 29 Discrete 32 Distance city-block 3 Manhattan 3 Dixon 24,25 Dresher 13, 41 8-Puzzle 1,2,4 Equation 54 system 54 Estimation 5 Estimator 65 A- 65 B- 67 more precise 67 Evaluation function static 3,4,18, 19,41,52,58 Event 29,58 Everywhere 38 Expectation 33 conditional 37, 38, 65 Face-value principle 20, 22, 69 Fallible 25 Feigenbaum 21 Finite intersection 29 Forced loss 78, 79 Forced win 22, 66, 78, 79, 82, 91, 94, 95 Fubini's Theorem 77 Function measurable 33
6 Index 105 Gambling 39 Game finite 5 G 1-10,20,47,56 G 2-47 G d- 5, 10, 20, 47 P 2-11, 20, 52 P b- 5,20,22 payoff 13 perfect information 5, 7, 18 player 18 T- 41 two-person 5, 18 WIN-LOSS 5, 66, 73, 78 zero-sum 5, 18 Game graph 9, 28, 40, 67 G 1-11,48 G 2-47 G d- 47 height 9, 40, 48, 49 Game model product 73, 74 G 1-52, 56, 88 G d- 46, 47, 87, 91, 99 P 2-52 P b- 45,81,98 Game set 54, 56 Game space P 2-28 Game theory 45 Game tree 8, 28, 40 level 10,41 link 8 nodes 9 non-terminal node 8, 9 predecessor 9 root 8,9,40 sons 8 subtree 9 successor 8, 9 terminal node 9, 40 Game value 13, 41, 42, 44, 64 Game-tree search 4, 15,52,59 heuristic 52, 59 pathology 4, 18,21,22,52,69,98 Gams 98 Global database Goal 2 Graph product 73, 74 search 2,4 Height 9,40,45,48,49,81 Heuristic information 3,4, 5, 28, 51, 57, 58, 94, 98 cumulative 52, 53, 57, 60, 62 local 75,78 product 75, 76, 77, 80 Heuristic search 3, 4, 5, 55, 59, 61, 65, 68 information 60 local 76 method 3 product 75, 76 HORIZONTAL 11 I.i.d. 45, 81 Inclusion 61 Independence 34, 73, 75 Indicator 66 Information complete 53, 59 cumulative 53, 62 partial 71 trivial 59 Integrable 34 Integration 33 Kalah 25 Knuth 17 Last player 48, 88 Leaves 40 LEFT 8 Localization 75 LOSS 23 Manhattan distance 3 Martingale 5, 28, 36, 39, 67 MAX 9, 10, 40, 43, 44, 45, 46, 47, 64 Mean 33, 34, 45 Measurable set 31, 58 Measurable function 33 Measure 31 product 35 MIN 9, 10,40, 43, 44, 45, 46, 47, 64 Minimal cost 3 Minimax procedure 13, 14,20,59 Minimax value 5, 13, 18, 40, 44, 81, 87, 89, 94 Misplaced tile 3 Moore 17 Morgenstern 13 Move chance 7 minimax optimal 14 optimal 13 personal 7
7 106 Index Nau 4, 1 I, 20, 22, 26, 27, 86, 98, 99 N -decision random variable 70, 71 N-decision-making 70, 71 Negmax 17 Nilsson 3, 19 Node LOSS 23 MAX 9, 40, 44, 49, 50, 80, 95 MIN 9,40,44,49,50,80,94 search-tip 3, 19 terminal 40 WIN 23 Node strength 28,64 Non-adversary 2 Non-comparable 61 NP-complete 5 One-counter 5, 52, 83, 88, 92 Optimal solution 3 OR 48,49,50 Partition 29 finer 30 proper refinement 30 properly finer 30 refinement 30 Pathological phenomenon 4, 18, 21, 22, 52, 69, 98 Payoff 9 final 9 Pearl 3, 4, 17, 22, 24, 45, 73, 98 Performance quality 22 Playing path 42 Pohl 4 Poker 7 PP rules 80 PP-l 79 PP-2 79 Precise equally 55, 61 more 55,61 non-comparable 61 properly more 55, 61 Predicted strength 25 Probabilistic game model 5,40,41 Probabilistic game space 32 Probability measure 30 Probability space 30 product 35 Problem graph-search 2 NP-complete 3 optimal 3 Problem state 2 Procedure *-MIN 25,26 alpha-beta 13, 14, 16,20,59 M&N 24 minimax 13, 14,20,59 product-propagation 5, 23, 24, 73, 77, 80, 81, 83,98 Product subgraph 73, 74 game model 73, 74 component 74,75 Product measure 35 Product-propagation 5,23,24,73,77,80,81,83, 98 Product set 35 Product space 35 Production rules 1, 2 Production system 1,2 Purdom 26, 27, 66 Random function 58 Random variable 33, 65 estimation 65 i.i.d., 45, 81 independent 34, 73, 75 mean 34,45 Random vector 41 Recurrence relation 46, 83, 84, 85 Reibman 25, 26 RIGHT 8 Root 40 Round 42 complete 42 Samuel 18 Search depth 21 Search event 60, 61 Search information 60,61 Search node 61,90, 93 Search value 90, 93 Singleton 59 Slagle 24, 25 Static value 19 Strategy 41 heuristic 18 minimax optimal 44, 45, 64, 68 non-randomized 42 randomized 43 Strength Subfield 29 Subgame 9 Successor 9
8 Index 107 T-game 41 Tic-tac-toe 1, 2, 19 Tzeng 26, 27,41, 66 VERTICAL 11 Visibility 22, 30, 61, 63 improved 63 von Neumann 13 Weighted average 26 WHITE 10 WIN 23 Zero-counter 61
An Analysis of Forward Pruning. to try to understand why programs have been unable to. pruning more eectively. 1
Proc. AAAI-94, to appear. An Analysis of Forward Pruning Stephen J. J. Smith Dana S. Nau Department of Computer Science Department of Computer Science, and University of Maryland Institute for Systems
More informationalgorithms Alpha-Beta Pruning and Althöfer s Pathology-Free Negamax Algorithm Algorithms 2012, 5, ; doi: /a
Algorithms 01, 5, 51-58; doi:10.3390/a504051 Article OPEN ACCESS algorithms ISSN 1999-4893 www.mdpi.com/journal/algorithms Alpha-Beta Pruning and Althöfer s Pathology-Free Negamax Algorithm Ashraf M. Abdelbar
More informationProperties of Forward Pruning in Game-Tree Search
Properties of Forward Pruning in Game-Tree Search Yew Jin Lim and Wee Sun Lee School of Computing National University of Singapore {limyewji,leews}@comp.nus.edu.sg Abstract Forward pruning, or selectively
More informationAlpha-Beta Pruning: Algorithm and Analysis
Alpha-Beta Pruning: Algorithm and Analysis Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction Alpha-beta pruning is the standard searching procedure used for 2-person
More informationKazuyuki Tanaka s work on AND-OR trees and subsequent development
Kazuyuki Tanaka s work on AND-OR trees and subsequent development Toshio Suzuki Department of Math. and Information Sciences, Tokyo Metropolitan University, CTFM 2015, Tokyo Institute of Technology September
More informationAlpha-Beta Pruning: Algorithm and Analysis
Alpha-Beta Pruning: Algorithm and Analysis Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction Alpha-beta pruning is the standard searching procedure used for 2-person
More informationAnnouncements. CS 188: Artificial Intelligence Spring Mini-Contest Winners. Today. GamesCrafters. Adversarial Games
CS 188: Artificial Intelligence Spring 2009 Lecture 7: Expectimax Search 2/10/2009 John DeNero UC Berkeley Slides adapted from Dan Klein, Stuart Russell or Andrew Moore Announcements Written Assignment
More informationPOLYNOMIAL SPACE QSAT. Games. Polynomial space cont d
T-79.5103 / Autumn 2008 Polynomial Space 1 T-79.5103 / Autumn 2008 Polynomial Space 3 POLYNOMIAL SPACE Polynomial space cont d Polynomial space-bounded computation has a variety of alternative characterizations
More informationLearning in Depth-First Search: A Unified Approach to Heuristic Search in Deterministic, Non-Deterministic, Probabilistic, and Game Tree Settings
Learning in Depth-First Search: A Unified Approach to Heuristic Search in Deterministic, Non-Deterministic, Probabilistic, and Game Tree Settings Blai Bonet and Héctor Geffner Abstract Dynamic Programming
More informationAlpha-Beta Pruning: Algorithm and Analysis
Alpha-Beta Pruning: Algorithm and Analysis Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction Alpha-beta pruning is the standard searching procedure used for solving
More informationAnnouncements. CS 188: Artificial Intelligence Fall Adversarial Games. Computing Minimax Values. Evaluation Functions. Recap: Resource Limits
CS 188: Artificial Intelligence Fall 2009 Lecture 7: Expectimax Search 9/17/2008 Announcements Written 1: Search and CSPs is up Project 2: Multi-agent Search is up Want a partner? Come to the front after
More informationCS 188: Artificial Intelligence Fall Announcements
CS 188: Artificial Intelligence Fall 2009 Lecture 7: Expectimax Search 9/17/2008 Dan Klein UC Berkeley Many slides over the course adapted from either Stuart Russell or Andrew Moore 1 Announcements Written
More informationNotes on induction proofs and recursive definitions
Notes on induction proofs and recursive definitions James Aspnes December 13, 2010 1 Simple induction Most of the proof techniques we ve talked about so far are only really useful for proving a property
More informationTwo hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Thursday 17th May 2018 Time: 09:45-11:45. Please answer all Questions.
COMP 34120 Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE AI and Games Date: Thursday 17th May 2018 Time: 09:45-11:45 Please answer all Questions. Use a SEPARATE answerbook for each SECTION
More informationCS 4100 // artificial intelligence. Recap/midterm review!
CS 4100 // artificial intelligence instructor: byron wallace Recap/midterm review! Attribution: many of these slides are modified versions of those distributed with the UC Berkeley CS188 materials Thanks
More informationScout, NegaScout and Proof-Number Search
Scout, NegaScout and Proof-Number Search Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Introduction It looks like alpha-beta pruning is the best we can do for a generic searching
More informationScout and NegaScout. Tsan-sheng Hsu.
Scout and NegaScout Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract It looks like alpha-beta pruning is the best we can do for an exact generic searching procedure.
More informationMinimax strategies, alpha beta pruning. Lirong Xia
Minimax strategies, alpha beta pruning Lirong Xia Reminder ØProject 1 due tonight Makes sure you DO NOT SEE ERROR: Summation of parsed points does not match ØProject 2 due in two weeks 2 How to find good
More informationAlpha-Beta Pruning Under Partial Orders
More Games of No Chance MSRI Publications Volume 42, 2002 Alpha-Beta Pruning Under Partial Orders MATTHEW L. GINSBERG AND ALAN JAFFRAY Abstract. Alpha-beta pruning is the algorithm of choice for searching
More informationIS-ZC444: ARTIFICIAL INTELLIGENCE
IS-ZC444: ARTIFICIAL INTELLIGENCE Lecture-07: Beyond Classical Search Dr. Kamlesh Tiwari Assistant Professor Department of Computer Science and Information Systems, BITS Pilani, Pilani, Jhunjhunu-333031,
More informationAlpha-Beta Pruning for Games with Simultaneous Moves
Alpha-Beta Pruning for Games with Simultaneous Moves Abdallah Saffidine LAMSADE, Université Paris-Dauphine, 75775 Paris Cedex 6, France Email: abdallahsaffidine@dauphinefr Hilmar Finnsson Reykjavík University,
More informationBasic Game Theory. Kate Larson. January 7, University of Waterloo. Kate Larson. What is Game Theory? Normal Form Games. Computing Equilibria
Basic Game Theory University of Waterloo January 7, 2013 Outline 1 2 3 What is game theory? The study of games! Bluffing in poker What move to make in chess How to play Rock-Scissors-Paper Also study of
More informationSingle parameter FPT-algorithms for non-trivial games
Single parameter FPT-algorithms for non-trivial games Author Estivill-Castro, Vladimir, Parsa, Mahdi Published 2011 Journal Title Lecture Notes in Computer science DOI https://doi.org/10.1007/978-3-642-19222-7_13
More informationCSE 573: Artificial Intelligence
CSE 573: Artificial Intelligence Autumn 2010 Lecture 5: Expectimax Search 10/14/2008 Luke Zettlemoyer Most slides over the course adapted from either Dan Klein, Stuart Russell or Andrew Moore 1 Announcements
More informationAN EXPECTED-COST ANALYSIS OF BACKTRACKING AND NON-BACKTRACKING ALGORITHMS
AN EXPECTED-COST ANALYSIS OF BACKTRACKING AND NON-BACKTRACKING ALGORITHMS C.J.H. McDiarmid Department of Statistics University of Oxford Oxford England 0X1 3TG email: MCD@vax.oxford.ac.uk G.M.A. Provan
More informationTHE SOLUTION FOR THE BRANCHING FACTOR OF THE ALPHA-BETA PRUNING ALGORITHM
THE SOLUTION FOR THE BRANCHING FACTOR OF THE ALPHA-BETA PRUNING ALGORITHM Judea Pearl Cognitive Systems Laboratory School of Engineering and Applied Science University of California, Los Angeles Los Angeles,
More informationSelected Algorithms of Machine Learning from Examples
Fundamenta Informaticae 18 (1993), 193 207 Selected Algorithms of Machine Learning from Examples Jerzy W. GRZYMALA-BUSSE Department of Computer Science, University of Kansas Lawrence, KS 66045, U. S. A.
More informationAgnostic Online learnability
Technical Report TTIC-TR-2008-2 October 2008 Agnostic Online learnability Shai Shalev-Shwartz Toyota Technological Institute Chicago shai@tti-c.org ABSTRACT We study a fundamental question. What classes
More informationInformation, Utility & Bounded Rationality
Information, Utility & Bounded Rationality Pedro A. Ortega and Daniel A. Braun Department of Engineering, University of Cambridge Trumpington Street, Cambridge, CB2 PZ, UK {dab54,pao32}@cam.ac.uk Abstract.
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence Adversarial Search II Instructor: Anca Dragan University of California, Berkeley [These slides adapted from Dan Klein and Pieter Abbeel] Minimax Example 3 12 8 2 4 6 14
More informationAdversarial Search & Logic and Reasoning
CSEP 573 Adversarial Search & Logic and Reasoning CSE AI Faculty Recall from Last Time: Adversarial Games as Search Convention: first player is called MAX, 2nd player is called MIN MAX moves first and
More information1 The General Definition
MS&E 336 Lecture 1: Dynamic games Ramesh Johari April 4, 2007 1 The General Definition A dynamic game (or extensive game, or game in extensive form) consists of: A set of players N; A set H of sequences
More informationAlgorithms for Playing and Solving games*
Algorithms for Playing and Solving games* Andrew W. Moore Professor School of Computer Science Carnegie Mellon University www.cs.cmu.edu/~awm awm@cs.cmu.edu 412-268-7599 * Two Player Zero-sum Discrete
More informationSequential Decisions
Sequential Decisions A Basic Theorem of (Bayesian) Expected Utility Theory: If you can postpone a terminal decision in order to observe, cost free, an experiment whose outcome might change your terminal
More informationA Game-Theoretic Analysis of Games with a Purpose
A Game-Theoretic Analysis of Games with a Purpose The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Published Version
More informationTHE concept of an AND-OR tree is interesting because
The Eigen Distribution of an AND-OR Tree under Directional Algorithms Toshio Suzuki, Member, IAENG, and Ryota Nakamura Abstract Consider a probability distribution d on the truth assignments to a perfect
More informationEvolutionary Bargaining Strategies
Evolutionary Bargaining Strategies Nanlin Jin http://cswww.essex.ac.uk/csp/bargain Evolutionary Bargaining Two players alternative offering game x A =?? Player A Rubinstein 1982, 1985: Subgame perfect
More informationLINEAR PROGRAMMING III
LINEAR PROGRAMMING III ellipsoid algorithm combinatorial optimization matrix games open problems Lecture slides by Kevin Wayne Last updated on 7/25/17 11:09 AM LINEAR PROGRAMMING III ellipsoid algorithm
More informationGame playing. Chapter 6. Chapter 6 1
Game playing Chapter 6 Chapter 6 1 Outline Minimax α β pruning UCT for games Chapter 6 2 Game tree (2-player, deterministic, turns) Chapter 6 3 Minimax Perfect play for deterministic, perfect-information
More informationPublished in: Tenth Tbilisi Symposium on Language, Logic and Computation: Gudauri, Georgia, September 2013
UvA-DARE (Digital Academic Repository) Estimating the Impact of Variables in Bayesian Belief Networks van Gosliga, S.P.; Groen, F.C.A. Published in: Tenth Tbilisi Symposium on Language, Logic and Computation:
More informationSF2972 Game Theory Written Exam with Solutions June 10, 2011
SF97 Game Theory Written Exam with Solutions June 10, 011 Part A Classical Game Theory Jörgen Weibull and Mark Voorneveld 1. Finite normal-form games. (a) What are N, S and u in the definition of a finite
More informationNash-solvable bidirected cyclic two-person game forms
DIMACS Technical Report 2008-13 November 2008 Nash-solvable bidirected cyclic two-person game forms by Endre Boros 1 RUTCOR, Rutgers University 640 Bartholomew Road, Piscataway NJ 08854-8003 boros@rutcor.rutgers.edu
More informationAlpha-Beta Pruning for Games with Simultaneous Moves
Alpha-Beta Pruning for Games with Simultaneous Moves Abdallah Saffidine LAMSADE, Université Paris-Dauphine, 75775 Paris Cedex 6, France Email: abdallahsaffidine@dauphinefr Hilmar Finnsson Reykjavík University,
More informationFinal exam of ECE 457 Applied Artificial Intelligence for the Spring term 2007.
Spring 2007 / Page 1 Final exam of ECE 457 Applied Artificial Intelligence for the Spring term 2007. Don t panic. Be sure to write your name and student ID number on every page of the exam. The only materials
More informationThe Effect of Mobility on Minimaxing of Game Trees with Random Leaf Values
The Effect of Mobility on Minimaxing of Game Trees with Random Leaf Values Mark Levene Department of Computer Science University College University of London Gower Street London WC1E 6BT Email: mlevene@cs.ucl.ac.uk
More informationRollout-based Game-tree Search Outprunes Traditional Alpha-beta
Journal of Machine Learning Research vol:1 8, 2012 Submitted 6/2012 Rollout-based Game-tree Search Outprunes Traditional Alpha-beta Ari Weinstein Michael L. Littman Sergiu Goschin aweinst@cs.rutgers.edu
More informationExamination Artificial Intelligence Module Intelligent Interaction Design December 2014
Examination Artificial Intelligence Module Intelligent Interaction Design December 2014 Introduction This exam is closed book, you may only use a simple calculator (addition, substraction, multiplication
More informationCS 188 Introduction to Fall 2007 Artificial Intelligence Midterm
NAME: SID#: Login: Sec: 1 CS 188 Introduction to Fall 2007 Artificial Intelligence Midterm You have 80 minutes. The exam is closed book, closed notes except a one-page crib sheet, basic calculators only.
More informationCS221 Practice Midterm
CS221 Practice Midterm Autumn 2012 1 ther Midterms The following pages are excerpts from similar classes midterms. The content is similar to what we ve been covering this quarter, so that it should be
More informationEvaluation for Pacman. CS 188: Artificial Intelligence Fall Iterative Deepening. α-β Pruning Example. α-β Pruning Pseudocode.
CS 188: Artificial Intelligence Fall 2008 Evaluation for Pacman Lecture 7: Expectimax Search 9/18/2008 [DEMO: thrashing, smart ghosts] Dan Klein UC Berkeley Many slides over the course adapted from either
More informationCS 188: Artificial Intelligence Fall 2008
CS 188: Artificial Intelligence Fall 2008 Lecture 7: Expectimax Search 9/18/2008 Dan Klein UC Berkeley Many slides over the course adapted from either Stuart Russell or Andrew Moore 1 1 Evaluation for
More informationAlternative Combinatorial Gray Codes
Alternative Combinatorial Gray Codes Cormier-Iijima, Samuel sciyoshi@gmail.com December 17, 2010 Abstract Gray codes have numerous applications in a variety of fields, including error correction, encryption,
More informationAdversarial Search. Christos Papaloukas, Iosif Angelidis. University of Athens November 2017
Adversarial Search Christos Papaloukas, Iosif Angelidis University of Athens November 2017 Christos P., Iosif A. Adversarial Search UoA, 2017 1 / 61 Main Aspects Formulation In order to perform an Adversarial
More informationComputational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 4 Fall 2010
Computational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 4 Fall 010 Peter Bro Miltersen January 16, 011 Version 1. 4 Finite Perfect Information Games Definition
More informationThe exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
CS 188 Fall 2015 Introduction to Artificial Intelligence Final You have approximately 2 hours and 50 minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.
More informationAnalytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search
Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search Tom Everitt and Marcus Hutter Australian National University, Canberra, Australia October 15, 2015 Abstract Breadth-first
More informationMATH4250 Game Theory 1. THE CHINESE UNIVERSITY OF HONG KONG Department of Mathematics MATH4250 Game Theory
MATH4250 Game Theory 1 THE CHINESE UNIVERSITY OF HONG KONG Department of Mathematics MATH4250 Game Theory Contents 1 Combinatorial games 2 1.1 Combinatorial games....................... 2 1.2 P-positions
More informationPartitions and Covers
University of California, Los Angeles CS 289A Communication Complexity Instructor: Alexander Sherstov Scribe: Dong Wang Date: January 2, 2012 LECTURE 4 Partitions and Covers In previous lectures, we saw
More informationQuantum Algorithms for Evaluating Min-Max Trees
Quantum Algorithms for Evaluating Min-Max Trees Richard Cleve 1,2,DmitryGavinsky 1, and D. L. Yonge-Mallo 1 1 David R. Cheriton School of Computer Science and Institute for Quantum Computing, University
More informationAverage Case Analysis of the Boyer-Moore Algorithm
Average Case Analysis of the Boyer-Moore Algorithm TSUNG-HSI TSAI Institute of Statistical Science Academia Sinica Taipei 115 Taiwan e-mail: chonghi@stat.sinica.edu.tw URL: http://www.stat.sinica.edu.tw/chonghi/stat.htm
More informationMidterm Examination CS540: Introduction to Artificial Intelligence
Midterm Examination CS540: Introduction to Artificial Intelligence November 1, 2005 Instructor: Jerry Zhu CLOSED BOOK (One letter-size notes allowed. Turn it in with the exam) LAST (FAMILY) NAME: FIRST
More informationMS&E 246: Lecture 12 Static games of incomplete information. Ramesh Johari
MS&E 246: Lecture 12 Static games of incomplete information Ramesh Johari Incomplete information Complete information means the entire structure of the game is common knowledge Incomplete information means
More information5.2 A characterization of the nonemptiness of the core
Computational Aspects of Game Theory Bertinoro Spring School Lecturer: Bruno Codenotti Lecture 5: The Core of Cooperative Games The core is by far the cooperative solution concept most used in Economic
More informationFinite Mixture Model of Bounded Semi-naive Bayesian Networks Classifier
Finite Mixture Model of Bounded Semi-naive Bayesian Networks Classifier Kaizhu Huang, Irwin King, and Michael R. Lyu Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin,
More informationGame Theory and its Applications to Networks - Part I: Strict Competition
Game Theory and its Applications to Networks - Part I: Strict Competition Corinne Touati Master ENS Lyon, Fall 200 What is Game Theory and what is it for? Definition (Roger Myerson, Game Theory, Analysis
More informationCMSC 474, Game Theory
CMSC 474, Game Theory 4b. Game-Tree Search Dana Nau University of Maryland Nau: Game Theory 1 Finite perfect-information zero-sum games! Finite: Ø finitely many agents, actions, states, histories! Perfect
More informationCS 188 Introduction to AI Fall 2005 Stuart Russell Final
NAME: SID#: Section: 1 CS 188 Introduction to AI all 2005 Stuart Russell inal You have 2 hours and 50 minutes. he exam is open-book, open-notes. 100 points total. Panic not. Mark your answers ON HE EXAM
More informationTijmen Daniëls Universiteit van Amsterdam. Abstract
Pure strategy dominance with quasiconcave utility functions Tijmen Daniëls Universiteit van Amsterdam Abstract By a result of Pearce (1984), in a finite strategic form game, the set of a player's serially
More informationComputing Minimax Decisions with Incomplete Observations
PMLR: Proceedings of Machine Learning Research, vol. 62, 358-369, 207 ISIPTA 7 Computing Minimax Decisions with Incomplete Observations Thijs van Ommen Universiteit van Amsterdam Amsterdam (The Netherlands)
More informationR u t c o r Research R e p o r t. Relations of Threshold and k-interval Boolean Functions. David Kronus a. RRR , April 2008
R u t c o r Research R e p o r t Relations of Threshold and k-interval Boolean Functions David Kronus a RRR 04-2008, April 2008 RUTCOR Rutgers Center for Operations Research Rutgers University 640 Bartholomew
More informationIntroduction to Spring 2006 Artificial Intelligence Practice Final
NAME: SID#: Login: Sec: 1 CS 188 Introduction to Spring 2006 Artificial Intelligence Practice Final You have 180 minutes. The exam is open-book, open-notes, no electronics other than basic calculators.
More informationDempster's Rule of Combination is. #P -complete. Pekka Orponen. Department of Computer Science, University of Helsinki
Dempster's Rule of Combination is #P -complete Pekka Orponen Department of Computer Science, University of Helsinki eollisuuskatu 23, SF{00510 Helsinki, Finland Abstract We consider the complexity of combining
More informationSequential Decisions
Sequential Decisions A Basic Theorem of (Bayesian) Expected Utility Theory: If you can postpone a terminal decision in order to observe, cost free, an experiment whose outcome might change your terminal
More informationCSC242: Intro to AI. Lecture 7 Games of Imperfect Knowledge & Constraint Satisfaction
CSC242: Intro to AI Lecture 7 Games of Imperfect Knowledge & Constraint Satisfaction What is This? 25" 20" 15" 10" 5" 0" Quiz 1 25" B 20" 15" 10" F D C A 5" F 0" Moral Many people cannot learn from lectures
More informationLearning an Effective Strategy in a Multi-Agent System with Hidden Information
Learning an Effective Strategy in a Multi-Agent System with Hidden Information Richard Mealing Supervisor: Jon Shapiro Machine Learning and Optimisation Group School of Computer Science University of Manchester
More informationDept. of Computer Science, University of British Columbia, Vancouver, BC, Canada.
EuroComb 2005 DMTCS proc. AE, 2005, 67 72 Directed One-Trees William Evans and Mohammad Ali Safari Dept. of Computer Science, University of British Columbia, Vancouver, BC, Canada. {will,safari}@cs.ubc.ca
More informationList coloring hypergraphs
List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University
More informationSummary. Agenda. Games. Intelligence opponents in game. Expected Value Expected Max Algorithm Minimax Algorithm Alpha-beta Pruning Simultaneous Game
Summary rtificial Intelligence and its applications Lecture 4 Game Playing Search onstraint Satisfaction Problems From start state to goal state onsider constraints Professor Daniel Yeung danyeung@ieee.org
More informationInformed Search. Chap. 4. Breadth First. O(Min(N,B L )) BFS. Search. have same cost BIBFS. Bi- Direction. O(Min(N,2B L/2 )) BFS. have same cost UCS
Informed Search Chap. 4 Material in part from http://www.cs.cmu.edu/~awm/tutorials Uninformed Search Complexity N = Total number of states B = Average number of successors (branching factor) L = Length
More informationA Note on the Connection between the Primal-Dual and the A* Algorithm
A Note on the Connection between the Primal-Dual and the A* Algorithm Xugang Ye, Johns Hopkins University, USA Shih-Ping Han, Johns Hopkins University, USA Anhua Lin, Middle Tennessee State University,
More informationInformed Search. Day 3 of Search. Chap. 4, Russel & Norvig. Material in part from
Informed Search Day 3 of Search Chap. 4, Russel & Norvig Material in part from http://www.cs.cmu.edu/~awm/tutorials Uninformed Search Complexity N = Total number of states B = Average number of successors
More informationThe Ins and Outs of Reason Maintenance
Reset reproduction of CMU Computer Science report CMU-CS-83-126. Published in IJCAI 83, pp. 349 351. Reprinted July 1994. Reprinting c Copyright 1983, 1994 by Jon Doyle. Current address: MIT Laboratory
More informationAlgorithmic Game Theory and Applications. Lecture 7: The LP Duality Theorem
Algorithmic Game Theory and Applications Lecture 7: The LP Duality Theorem Kousha Etessami recall LP s in Primal Form 1 Maximize c 1 x 1 + c 2 x 2 +... + c n x n a 1,1 x 1 + a 1,2 x 2 +... + a 1,n x n
More informationSpace Complexity. Master Informatique. Université Paris 5 René Descartes. Master Info. Complexity Space 1/26
Space Complexity Master Informatique Université Paris 5 René Descartes 2016 Master Info. Complexity Space 1/26 Outline Basics on Space Complexity Main Space Complexity Classes Deterministic and Non-Deterministic
More informationNondeterministic/conditional planning
Nondeterministic/conditional planning World is not predictable. AI robotics: imprecise movement of the robot other robots human beings, animals machines (cars, trains, airplanes, lawn-mowers,...) natural
More informationIntroduction to integer programming II
Introduction to integer programming II Martin Branda Charles University in Prague Faculty of Mathematics and Physics Department of Probability and Mathematical Statistics Computational Aspects of Optimization
More informationA Note on Kuhn s Theorem
A Note on Kuhn s Theorem Adam Brandenburger Stern School of Business New York University 44 West Fourth Street New York, NY 10012, United States of America adam.brandenburger@stern.nyu.edu Abstract We
More informationSubgame-Perfect Equilibria for Stochastic Games
MATHEMATICS OF OPERATIONS RESEARCH Vol. 32, No. 3, August 2007, pp. 711 722 issn 0364-765X eissn 1526-5471 07 3203 0711 informs doi 10.1287/moor.1070.0264 2007 INFORMS Subgame-Perfect Equilibria for Stochastic
More information280 Eiji Takimoto and Manfred K. Warmuth
The Last-Step Minimax Algorithm Eiji Takimoto 1? and Manfred K. Warmuth?? 1 Graduate School of Information Sciences, Tohoku University Sendai, 980-8579, Japan. t@ecei.tohoku.ac.jp Computer Science Department,
More informationEconomics 703 Advanced Microeconomics. Professor Peter Cramton Fall 2017
Economics 703 Advanced Microeconomics Professor Peter Cramton Fall 2017 1 Outline Introduction Syllabus Web demonstration Examples 2 About Me: Peter Cramton B.S. Engineering, Cornell University Ph.D. Business
More informationFINAL EXAM CHEAT SHEET/STUDY GUIDE. You can use this as a study guide. You will also be able to use it on the Final Exam on
FINAL EXAM CHEAT SHEET/STUDY GUIDE You can use this as a study guide. You will also be able to use it on the Final Exam on Tuesday. If there s anything else you feel should be on this, please send me email
More informationThe Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks Johan H.P. Kwisthout and Hans L. Bodlaender and L.C. van der Gaag 1 Abstract. Algorithms for probabilistic inference in Bayesian
More information6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2
6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2 Daron Acemoglu and Asu Ozdaglar MIT October 14, 2009 1 Introduction Outline Mixed Strategies Existence of Mixed Strategy Nash Equilibrium
More information(tree searching technique) (Boolean formulas) satisfying assignment: (X 1, X 2 )
Algorithms Chapter 5: The Tree Searching Strategy - Examples 1 / 11 Chapter 5: The Tree Searching Strategy 1. Ex 5.1Determine the satisfiability of the following Boolean formulas by depth-first search
More informationApplying Bayesian networks in the game of Minesweeper
Applying Bayesian networks in the game of Minesweeper Marta Vomlelová Faculty of Mathematics and Physics Charles University in Prague http://kti.mff.cuni.cz/~marta/ Jiří Vomlel Institute of Information
More informationGame Theory: Lecture 2
Game Theory: Lecture 2 Tai-Wei Hu June 29, 2011 Outline Two-person zero-sum games normal-form games Minimax theorem Simplex method 1 2-person 0-sum games 1.1 2-Person Normal Form Games A 2-person normal
More informationA New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach Daniel Raible & Henning Fernau University of Trier, FB 4 Abteilung Informatik, 54286 Trier, Germany {raible,fernau}@informatik.uni-trier.de Abstract.
More informationWEAKLY DOMINATED STRATEGIES: A MYSTERY CRACKED
WEAKLY DOMINATED STRATEGIES: A MYSTERY CRACKED DOV SAMET Abstract. An informal argument shows that common knowledge of rationality implies the iterative elimination of strongly dominated strategies. Rationality
More informationEquilibrium Points of an AND-OR Tree: under Constraints on Probability
Equilibrium Points of an AND-OR Tree: under Constraints on Probability Toshio Suzuki 1 Yoshinao Niida 2 Department of Math. and Information Sciences, Tokyo Metropolitan University, 1 The speaker, 2 Current
More informationFinal exam of ECE 457 Applied Artificial Intelligence for the Fall term 2007.
Fall 2007 / Page 1 Final exam of ECE 457 Applied Artificial Intelligence for the Fall term 2007. Don t panic. Be sure to write your name and student ID number on every page of the exam. The only materials
More information