1 / 18

CS182 Intelligent Machines: Reasoning, Actions and Plans

CS182 Intelligent Machines: Reasoning, Actions and Plans . Section 3. Tic-Tac-Toe. A Variation of Tic-Tac-Toe. Diagonal row (5 point!), vertical row (3 point!) and horizontal row (1 point!) Suppose you play and it’s your turn now:. Game Tree. Utilities. +1. -3. -1. -3. -1. -3.

hafwen
Download Presentation

CS182 Intelligent Machines: Reasoning, Actions and Plans

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS182 Intelligent Machines:Reasoning, Actions and Plans Section 3

  2. Tic-Tac-Toe

  3. A Variation of Tic-Tac-Toe • Diagonal row (5 point!), vertical row (3 point!) and horizontal row (1 point!) • Suppose you play and it’s your turn now:

  4. Game Tree

  5. Utilities +1 -3 -1 -3 -1 -3 +1 +1 +3 +3 +1 +1 -5 -5

  6. Solve the Game 1 -3 -3 1 -3 1 -3 -1 3 -3 -1 3 1 -3 1 -5 1 3 3 1 -5 1 -5 -5

  7. Alpha-Beta Pruning

  8. Alpha-Beta Pruning By Hand! 1 -3 1 () () () 1 -3 -3 3 1 -3 -3 () () () () () () () () () () () () () () () () () -3 -1 -3 -1 1 1 -5 -3 () () 1 1 3 3 1 1 () () -5 -5

  9. Evaluation Function • Sometimes we really can’t make it to the terminal nodes… • Cut-off tests and evaluation functions – How likely is this node to lead to a win? • Evaluation function for Tic-tac-toe? • How many rows/columns your crosses/circles spread? • Among all diagonal/vertical/horizontal rows, how many are still reachable? • Winning patterns?

  10. Constraint Satisfaction Problem: Can we graduate?

  11. CSP for course requirements (1) Alby-Bach University (ABU) wants to start a new degree program: B.S in Judgment Day Prevention (JDP). Suppose the degree program is associated with the following courses: • 15-211 Fundamental Data Structures and Algorithms • 15-212 Principles of Programming • 15-381 Artificial Intelligence: Representation and Problem-Solving • 15-681 Machine Learning • 80-310 Logic and Computation • 21-484 Graph Theory • 70-122 Accounting • 70-311 Organizational Behavior • 19-601 Information Warfare

  12. CSP for course requirements (2) In order to graduate from the degree program, one must complete the following four requirements: • Algorithms Requirement: (15-211 AND 15-212) OR (15-211 AND 15-381) OR (15-681 AND 21-484) • Machine Learning Requirement: 15-381 OR 15-681 OR 80-310 • Communications Requirement: 21-484 OR 70-311 OR 70-122 • Information Warfare Requirement: 15-381 OR 19-601

  13. CSP for course requirements (3) In addition, the department imposes the following restrictions: • Information Aggressiveness Restriction: So that they can’t make their programs TOO smart, students can take only one class from the set 15-381, 15-681, and 19-601. • Basic Arithmetic Restriction: Students can’t take both 15-211 and 70-122. • Organization Restriction: Students can’t take both 21-484 and 70-311. • Finally, courses cannot be used to count towards multiple graduation requirements - so if you use 15-381 to fulfill part of the Algorithms requirement it can’t count towards either the Machine Learning Requirement or the Information Warfare Requirement.

  14. Model the problem as CSP (1) • What are the variables? • AR_1 • AR_2 • MLR • CR • IWR

  15. Model the problem as CSP (2) • What are the domains? • AR_1: 15-211, 15-212, 15-381, 15-681, 21-484 • AR_2: 15-211, 15-212, 15-381, 15-681, 21-484 • MLR: 15-381, 15-681, 80-310 • CR: 21-484, 70-122, 70-311 • IWR: 15-381, 19-601

  16. Model the problem as CSP (3) • What are the constraints? • IAR: 1 of 15-381, 15-681, and 19-601 can be assigned to the 5 variables. • BAR: 1 of 15-211 and 70-122 can be assigned to the 5 variables • OR: 1 of 21-484 and 70-311 can be assigned to the 5 variables • No double counting: if a variable is assigned to one variable it can’t be assigned to another variable • Hidden constraint between AR_1 and AR_2

  17. Forward Checking and Constraint Propagation (1) • Suppose John has already taken 19-601 towards his Information Warfare Requirement and 15-211 towards his Algorithms Requirement. • Use forward checking and constraint propagation to determine other classes he must take to graduate • Can he graduate?

  18. Forward Checking and Constraint Propagation (1) AR 1 has been set to 15-211 and IWR has been set to 19-601. Forward checking can then be used as follows: • AR 2 domain goes from 15-212,15-381,15-681,21-484 to 15-212 due to IAR. • MLR domain goes to 80-310 due to IAR. • CR goes to 21-484,70-311 due to BAR. Constraint propagation can then • MLR domain has a single member, so we select 80-310. • AR 2 also has a single member, so we can select 15-212. So we have a schedule which satisfies AR 1, AR 2, MLR, and CR. But to satisfy the CR we have to select between 21-484 and 70-311 (we can’t pick both)  we would need to do some search here to pick between them

More Related