CS 4700: Artificial Intelligence
|
|
- Logan Rose
- 5 years ago
- Views:
Transcription
1 CS 4700: Foundations of Artificial Intelligence Fall 2017 Instructor: Prof. Haym Hirsh Lecture 8
2 Today Informed Search (R&N Ch 3,4) Adversarial search (R&N Ch 5) Adversarial Search (R&N Ch 5) Homework due Tuesday, February 28
3 Office Hours This week: Friday (tomorrow) 1:30-2:30pm Starting next week: Tuesdays 1:30-2:30pm
4 Homework 1 Clarifications 1: Brief definition of intelligence, like a dictionary 2b, 3b: Draw the search space Means all states and operators Does not depend on the search method used on it. 3: You can empty the jugs. 5d: Was h 1 s = a g(s) + b h(s) Should have been f(s) = a g(s) + b h(s)
5 Iterative Deepening Search A Initial State B C D Goal
6 Iterative Deepening Search Depth Bound = 1 A DFS with depth bound = 1 B C D
7 Iterative Deepening Search Depth Bound = 1 A 1 DFS with depth bound = 1 B C D
8 Iterative Deepening Search Depth Bound = 2 A 1 B C DFS with depth bound = 2 D
9 Iterative Deepening Search Depth Bound = 2 A 1,2 B C DFS with depth bound = 2 D
10 Iterative Deepening Search Depth Bound = 2 A 1,2 3 B C DFS with depth bound = 2 D
11 Iterative Deepening Search Depth Bound = 2 A 1,2 3 B C 4 DFS with depth bound = 2 D
12 Iterative Deepening Search Depth Bound = 3 A 1,2 3 B C 4 D DFS with depth bound = 3
13 Iterative Deepening Search Depth Bound = 3 A 1,2,5 3 B C 4 D DFS with depth bound = 3
14 Iterative Deepening Search Depth Bound = 3 A 1,2,5 3,6 B C 4 D DFS with depth bound = 3
15 Iterative Deepening Search Depth Bound = 3 A 1,2,5 3,6 B C 4,7 D DFS with depth bound = 3
16 Iterative Deepening Search Depth Bound = 3 A 1,2,5 3,6 B C 4,7 C gets placed on closed list! D DFS with depth bound = 3
17 Iterative Deepening Search Depth Bound = 3 A 1,2,5 3,6 B C 4,7 D DFS with depth bound = 3
18 Iterative Deepening Search Depth Bound = 3 A 1,2,5 3,6 B C 4,7 C already on closed list, so D is not reached! D DFS with depth bound = 3
19 Iterative Deepening Search Depth Bound = 4 A 1,2,5 3,6 B C 4,7 D 8 DFS with depth bound = 4
20 Iterative Deepening Search Depth Bound = 4 A 1,2,5,8 3,6 B C 4,7 D 8 DFS with depth bound = 4
21 Iterative Deepening Search Depth Bound = 4 A 1,2,5,8 3,6,9 B C 4,7 D 8 DFS with depth bound = 4
22 Iterative Deepening Search Depth Bound = 4 A 1,2,5,8 3,6,9 B C 4,7,10 D 8 DFS with depth bound = 4
23 Iterative Deepening Search Depth Bound = 4 A 1,2,5,8 3,6,9 B C 4,7,10 D 11 DFS with depth bound = 4
24 Iterative Deepening Search Depth Bound = 4 A 1,2,5,8 3,6,9 B C 4,7,10 Iterative Deepening finds solution 3 steps from start rather than 2! D 11 DFS with depth bound = 4
25 Iterative Deepening Search Algorithm given in class: Finds optimal solution for search trees (complete and optimal) Finds a solution, but not necessarily an optimal one for search graphs (complete but not optimal) Homework 1 Question 2: Draw what iterative deepening does
26 Other Search Methods Informed Search
27 Local Beam Search Like hill-climbing, only maintain k states, k>1 BeamSearch(states,ops): { states k} successors {s s = apply(s,o) where s states and o ops}; If goal(s ) for any s successors then return that s { implementation might interleave successor generation b } { and goal testing so as to stop when first solution is found } Else If successors > k then throw away all but best k of successors; BeamSearch(successors,ops) (If you let k=1 you get hill-climbing)
28 Genetic Algorithm Motivated by evoluationary biology Similar to Local Beam Search: Maintains k states called the population f(s) is typically called the fitness function Often greater values mean better Assumes states have structure, typically that they are n-tuples Genetic programming: states are programs Common operators: Crossover: Pick two states with good f values, and generate a new state whose elements are each randomly chosen from one or the other of the two states Mutation: With low probability mutate a state by a small amount
29 Genetic Algorithm Example: 8-queens Start with a population of k boards with 8 queens randomly placed in each Fitness(s) = # pairs of attacking queens (lower is better) Create a new population of k boards from the existing population by a combination of: Crossover: Select two boards s 1 and s 2 from population Bias board selection towards better boards (better board greater probability of selection) Select random i, i {2,,7} Create new board taking i random queens from s 1 and the remaining queens from s 2 Mutation: take a board and with low probability randomly move each queen
30 Other Directions (Not Covering) Continuous spaces / gradient-based methods Newton s method Linear programming (Until machine learning) Non-deterministic actions Partially observable states Online search Dynamic programming Searching AND/OR trees
31 Adversarial Search
32 Adversarial Search (Game Tree Search)
33 Let s Play a Game Each player takes one of the digits 1-9 and removes it First player to wind up with 3 of its numbers adding up to 15 wins If all numbers are used up it s a tie
34 Let s Play a Game Example Player 1: Player 2:
35 Let s Play a Game Example Player 1: 3 Player 2:
36 Let s Play a Game Example Player 1: 3 Player 2: 8
37 Let s Play a Game Example Player 1: 3 7 Player 2: 8
38 Let s Play a Game Example Player 1: 3 7 Player 2: 8
39 Let s Play a Game Example Player 1: 3 7 Player 2: 8 5
40 Let s Play a Game Example Player 1: 3 7 Player 2: 8 5
41 Let s Play a Game Example Player 1: Player 2: 8 5
42 Let s Play a Game Example Player 1: Player 2: 8 5
43 Let s Play a Game Example Player 1: Player 2: 8 5 6
44 Let s Play a Game Example Player 1: Player 2: 8 5 6
45 Let s Play a Game Example Player 1: Player 2: 8 5 6
46 Let s Play a Game Example Player 1: Player 2:
47 Let s Play a Game
48 Magic Square Tic Tac Toe
49 Minimax Value of a Game My Turn
50 Minimax Value of a Game My Turn Terminal Nodes
51 Minimax Value of a Game My Turn I Win Opponent Wins Terminal Nodes
52 Minimax Value of a Game I win = + I lose = My Turn Terminal Nodes
53 Minimax Value of a Game I win = + I lose = (Tie = 0) My Turn Terminal Nodes
54 Minimax Value of a Game I win = + I lose = (Tie = 0) (could choose +1 / 0 / -1, 1 / ½ / 0, or any appropriate scale) + My Turn - - Terminal Nodes
55 Minimax Value of a Game I win = + I lose = My Turn Terminal Nodes
56 Minimax Value of a Game I win = + I lose = My Turn Terminal Nodes
57 Minimax Value of a Game I win = + I lose = My Turn Terminal Nodes
58 Minimax Value of a Game I win = + I lose = My Opponent s Turn Terminal Nodes
59 Minimax Value of a Game I win = + I lose = My Opponent s Turn Terminal Nodes
60 Minimax Value of a Game Current state: s Available operators: ops Value of a state: V(s) My turn: Value of state s = V(s) = max Best move = = argmax o ops o ops Opponent s turn: Value of state s = V(s) = min {V apply s, o } {V apply s, o } o ops {V apply s, o } Best move = = argmin{v apply s, o } o ops
61 Minimax Value of a Game Current state: s Available operators: ops Value of a state: V(s) My turn: Value of state s = V(s) = max Best move = = argmax o ops o ops Opponent s turn: Value of state s = V(s) = min {V apply s, o } {V apply s, o } o ops {V apply s, o } Best move = = argmin{v apply s, o } o ops
62 Minimax Value of a Game Current state: s Available operators: ops Value of a state: V(s) My turn: Value of state s = V(s) = max Best move = = argmax o ops o ops {V apply s, o } {V apply s, o } Opponent s turn: Assumes opponent always does best move Value of state s = V(s) = min o ops {V apply s, o } Best move = = argmin{v apply s, o } o ops
63 Minimax Value of a Game My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors
64 Minimax Value of a Game My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors
65 Minimax Value of a Game My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors
66 Minimax Value of a Game My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors
67 Minimax Value of a Game My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors
68 Minimax Value of a Game My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors
69 Minimax Value of a Game My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors Can be continued arbitrarily deeply
70 Minimax Value of a Game My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors Can be continued arbitrarily deeply My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors
71 Minimax Value of a Game My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors Can be continued arbitrarily deeply My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors
72 Minimax Value of a Game My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors Can be continued arbitrarily deeply My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors
73 Minimax Value of a Game My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors Can be continued arbitrarily deeply My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors
74 Minimax Value of a Game My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors Can be continued arbitrarily deeply My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors
75 Minimax Value of a Game GAME TREE My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors Can be continued arbitrarily deeply My Turn V(s) = Max of successors My Opponent s Turn V(s) = Min of successors
76 Pictorial Depiction of Full Tic Tac Toe Game Tree From "Fractal images of formal systems" by Paul St Denis and Patrick Grim, Journal of philosophical logic 26.2 (1997):
77 (Partial) Game Tree for Tic Tac Toe 0 +
78 Minimax Value of a Game Current state: s Available operators: ops Value of a state: V(s) My turn: Value of state s = V(s) = max Best move = = argmax o ops o ops Opponent s turn: Value of state s = V(s) = min {V apply s, o } {V apply s, o } o ops {V apply s, o } Best move = = argmin{v apply s, o } o ops
79 Minimax Algorithm Initial call: If I go first: minimax(initial-state,ops) If opponent goes first: maximin(initial-state,ops)
80 Minimax Algorithm minimax(s,ops): if terminal(s) then return V(s) else val - ; foreach o ops val maximin(apply(s,o),ops); if val > val then val val ; bestop o; return val
81 Minimax Algorithm minimax(s,ops): if terminal(s) then return V(s) else val - ; foreach o ops val maximin(apply(s,o),ops); if val > val then val val ; bestop o; return val maximin(s,ops): if terminal(s) then return V(s) else val + ; foreach o ops val minimax(apply(s,o),ops); if val < val then val val ; bestop o; return val
82 Minimax Search Multiagent environment Often just two agents Common setting is a game Competitive Each agent is self-interested Non-cooperative non-collaborative (except through self-interest) Assume opponent always optimizes what s best for the opponent Zero sum Deterministic (example: not backgammon dice!) Perfect information (example: poker hidden cards!)
83 Minimax Algorithm minimax(s,ops): if terminal(s) then return V(s) else val - ; foreach o ops val maximin(apply(s,o),ops); if val > val then val val ; bestop o; return val maximin(s,ops): if terminal(s) then return V(s) else val + ; foreach o ops val minimax(apply(s,o),ops); if val < val then val val ; bestop o; return val
84 Minimax Algorithm (Complete Search) minimax(s,ops): if terminal(s) then return V(s) else val - ; foreach o ops val maximin(apply(s,o),ops); if val > val then val val ; bestop o; return val maximin(s,ops): if terminal(s) then return V(s) else val + ; foreach o ops val minimax(apply(s,o),ops); if val < val then val val ; bestop o; return val
85 Minimax Algorithm (Complete Search) minimax(s,ops): if terminal(s) then return V(s) else val - ; foreach o ops val maximin(apply(s,o),ops); if val > val then val val ; bestop o; return val maximin(s,ops): if terminal(s) then return V(s) else val + ; foreach o ops val minimax(apply(s,o),ops); if val < val then val val ; bestop o; return val
CS 4700: Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence Fall 2017 Instructor: Prof. Haym Hirsh Lecture 7 Extra Credit Opportunity: Lecture Today 4:15pm Gates G01 Learning to See Without a Teacher Phillip Isola
More informationFinding optimal configurations Adversarial search
CS 171 Introduction to AI Lecture 10 Finding optimal configurations Adversarial search Milos Hauskrecht milos@cs.pitt.edu 39 Sennott Square Announcements Homework assignment is out Due on Thursday next
More informationCS 4700: Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence Fall 2017 Instructor: Prof. Haym Hirsh Lecture 5 Piazza course website is up: piazza.com/cornell/spring2017/cs4700 The researchers found that when apples
More informationGradient Descent. 1) S! initial state 2) Repeat: Similar to: - hill climbing with h - gradient descent over continuous space
Local Search 1 Local Search Light-memory search method No search tree; only the current state is represented! Only applicable to problems where the path is irrelevant (e.g., 8-queen), unless the path is
More informationPotential Midterm Exam Questions
Potential Midterm Exam Questions 1. What are the four ways in which AI is usually viewed? Which of the four is the preferred view of the authors of our textbook? 2. What does each of the lettered items
More informationChapters 3-5 Problem Solving using Search
CSEP 573 Chapters 3-5 Problem Solving using Search First, they do an on-line search CSE AI Faculty Example: The 8-puzzle Example: The 8-puzzle 1 2 3 8 4 7 6 5 1 2 3 4 5 6 7 8 2 Example: Route Planning
More information3.6.2 Generating admissible heuristics from relaxed problems
3.6.2 Generating admissible heuristics from relaxed problems To come up with heuristic functions one can study relaxed problems from which some restrictions of the original problem have been removed The
More informationUniversity of Waterloo Department of Electrical and Computer Engineering ECE 457A: Cooperative and Adaptive Algorithms Midterm Examination
University of Waterloo Department of Electrical and Computer Engineering ECE 457A: Cooperative and Adaptive Algorithms Midterm Examination Exam Date/Time: Tuesday, June 13, 2017, 8:30-9:50 pm Exam Hall:
More informationCS 540: Introduction to Artificial Intelligence
CS 540: Introduction to Artificial Intelligence Midterm Exam: 7:15-9:15 pm, October, 014 Room 140 CS Building CLOSED BOOK (one sheet of notes and a calculator allowed) Write your answers on these pages
More informationUninformed Search Methods. Informed Search Methods. Midterm Exam 3/13/18. Thursday, March 15, 7:30 9:30 p.m. room 125 Ag Hall
Midterm Exam Thursday, March 15, 7:30 9:30 p.m. room 125 Ag Hall Covers topics through Decision Trees and Random Forests (does not include constraint satisfaction) Closed book 8.5 x 11 sheet with notes
More informationBeyond Classical Search: Local Search. CMPSCI 383 September 23, 2011
Beyond Classical Search: Local Search CMPSCI 383 September 23, 2011 1 Today s lecture Local Search Hill-climbing Simulated annealing Local beam search Genetic algorithms Genetic programming Local search
More informationArtificial Intelligence. Game trees. Two-player zero-sum game. Goals for the lecture. Blai Bonet
Artificial Intelligence Blai Bonet Game trees Universidad Simón Boĺıvar, Caracas, Venezuela Goals for the lecture Two-player zero-sum game Two-player game with deterministic actions, complete information
More informationCSCI-630 Foundations of Intelligent Systems Fall 2015, Prof. Zanibbi
CSCI-630 Foundations of Intelligent Systems Fall 2015, Prof. Zanibbi Midterm Examination Name: October 16, 2015. Duration: 50 minutes, Out of 50 points Instructions If you have a question, please remain
More informationReview Adversarial (Game) Search ( ) Review Constraint Satisfaction ( ) Please review your quizzes and old CS-271 tests
Review Agents (2.1-2.3) Mid-term Review Chapters 2-6 Review State Space Search Problem Formulation (3.1, 3.3) Blind (Uninformed) Search (3.4) Heuristic Search (3.5) Local Search (4.1, 4.2) Review Adversarial
More informationChapter 2 Classical algorithms in Search and Relaxation
Chapter 2 Classical algorithms in Search and Relaxation Chapter 2 overviews topics on the typical problems, data structures, and algorithms for inference in hierarchical and flat representations. Part
More informationCPSC 436D Video Game Programming
CPSC 436D Video Game Programming Strategy & Adversarial Strategy Strategy Given current state, determine BEST next move Short term: best among immediate options Long term: what brings something closest
More informationEE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 4, 4/11/2005 University of Washington, Department of Electrical Engineering Spring 2005 Instructor: Professor Jeff A. Bilmes Today: Informed search algorithms
More informationCS 188: Artificial Intelligence. Recap Search I
CS 188: Artificial Intelligence Review of Search, CSPs, Games DISCLAIMER: It is insufficient to simply study these slides, they are merely meant as a quick refresher of the high-level ideas covered. You
More informationAdvanced A* Improvements
Advanced A* Improvements 1 Iterative Deepening A* (IDA*) Idea: Reduce memory requirement of A* by applying cutoff on values of f Consistent heuristic function h Algorithm IDA*: 1. Initialize cutoff to
More informationN-Queens problem. Administrative. Local Search
Local Search CS151 David Kauchak Fall 2010 http://www.youtube.com/watch?v=4pcl6-mjrnk Some material borrowed from: Sara Owsley Sood and others Administrative N-Queens problem Assign 1 grading Assign 2
More informationLecture 9. Heuristic search, continued. CS-424 Gregory Dudek
Lecture 9 Heuristic search, continued A* revisited Reminder: with A* we want to find the best-cost (C ) path to the goal first. To do this, all we have to do is make sure our cost estimates are less than
More informationAr#ficial)Intelligence!!
Introduc*on! Ar#ficial)Intelligence!! Roman Barták Department of Theoretical Computer Science and Mathematical Logic We know how to use heuristics in search BFS, A*, IDA*, RBFS, SMA* Today: What if the
More informationAnnouncements. CS 188: Artificial Intelligence Fall Reminder: CSPs. Today. Example: 3-SAT. Example: Boolean Satisfiability.
CS 188: Artificial Intelligence Fall 2008 Lecture 5: CSPs II 9/11/2008 Announcements Assignments: DUE W1: NOW P1: Due 9/12 at 11:59pm Assignments: UP W2: Up now P2: Up by weekend Dan Klein UC Berkeley
More informationCS 188: Artificial Intelligence Fall 2008
CS 188: Artificial Intelligence Fall 2008 Lecture 5: CSPs II 9/11/2008 Dan Klein UC Berkeley Many slides over the course adapted from either Stuart Russell or Andrew Moore 1 1 Assignments: DUE Announcements
More informationVorlesung Grundlagen der Künstlichen Intelligenz
Vorlesung Grundlagen der Künstlichen Intelligenz Reinhard Lafrenz / Prof. A. Knoll Robotics and Embedded Systems Department of Informatics I6 Technische Universität München www6.in.tum.de lafrenz@in.tum.de
More informationAI: Week 2. Tom Henderson. Fall 2014 CS 5300
AI: Week 2 Tom Henderson Fall 2014 What s a Problem? Initial state Actions Transition model Goal Test Path Cost Does this apply to: Problem: Get A in CS5300 Solution: action sequence from initial to goal
More informationToday. CS 188: Artificial Intelligence Fall Example: Boolean Satisfiability. Reminder: CSPs. Example: 3-SAT. CSPs: Queries.
CS 188: Artificial Intelligence Fall 2007 Lecture 5: CSPs II 9/11/2007 More CSPs Applications Tree Algorithms Cutset Conditioning Today Dan Klein UC Berkeley Many slides over the course adapted from either
More informationMonotonicity. Admissible Search: That finds the shortest path to the Goal. Monotonicity: local admissibility is called MONOTONICITY
Monotonicity Admissible Search: That finds the shortest path to the Goal Monotonicity: local admissibility is called MONOTONICITY This property ensures consistently minimal path to each state they encounter
More informationSection Marks Pre-Midterm / 32. Logic / 29. Total / 100
Name: CS 331 Final Exam Spring 2011 You have 110 minutes to complete this final exam. You are only allowed to use your textbook, your notes, your assignments and solutions to those assignments during this
More informationCS 380: Artificial Intelligence Lecture #4
CS 380: Artificial Intelligence Lecture #4 William Regli Material Chapter 4 Section 1-3 1 Outline Best-first search Greedy best-first search A * search Heuristics Local search algorithms Hill-climbing
More informationMidterm Examination CS 540-2: Introduction to Artificial Intelligence
Midterm Examination CS 54-2: Introduction to Artificial Intelligence March 9, 217 LAST NAME: FIRST NAME: Problem Score Max Score 1 15 2 17 3 12 4 6 5 12 6 14 7 15 8 9 Total 1 1 of 1 Question 1. [15] State
More informationArtificial Intelligence CS 6364
Artificial Intelligence CS 6364 Professor Dan Moldovan Section 4 Informed Search and Adversarial Search Outline Best-first search Greedy best-first search A* search Heuristics revisited Minimax search
More informationArtificial Intelligence
Artificial Intelligence Informed Search and Exploration Chapter 4 (4.3 4.6) Searching: So Far We ve discussed how to build goal-based and utility-based agents that search to solve problems We ve also presented
More informationCIS 192: Artificial Intelligence. Search and Constraint Satisfaction Alex Frias Nov. 30 th
CIS 192: Artificial Intelligence Search and Constraint Satisfaction Alex Frias Nov. 30 th What is AI? Designing computer programs to complete tasks that are thought to require intelligence 4 categories
More informationProgram of Study. Artificial Intelligence 1. Shane Torbert TJHSST
Program of Study Artificial Intelligence 1 Shane Torbert TJHSST Course Selection Guide Description for 2011/2012: Course Title: Artificial Intelligence 1 Grade Level(s): 10-12 Unit of Credit: 0.5 Prerequisite:
More informationCS 416, Artificial Intelligence Midterm Examination Fall 2004
CS 416, Artificial Intelligence Midterm Examination Fall 2004 Name: This is a closed book, closed note exam. All questions and subquestions are equally weighted. Introductory Material 1) True or False:
More informationAdministrative. Local Search!
Administrative Local Search! CS311 David Kauchak Spring 2013 Assignment 2 due Tuesday before class Written problems 2 posted Class participation http://www.youtube.com/watch? v=irhfvdphfzq&list=uucdoqrpqlqkvctckzqa
More informationARTIFICIAL INTELLIGENCE. Informed search
INFOB2KI 2017-2018 Utrecht University The Netherlands ARTIFICIAL INTELLIGENCE Informed search Lecturer: Silja Renooij These slides are part of the INFOB2KI Course Notes available from www.cs.uu.nl/docs/vakken/b2ki/schema.html
More informationIntroduction to Computer Science and Programming for Astronomers
Introduction to Computer Science and Programming for Astronomers Lecture 9. István Szapudi Institute for Astronomy University of Hawaii March 21, 2018 Outline Reminder 1 Reminder 2 3 Reminder We have demonstrated
More informationCS W4701 Artificial Intelligence
CS W4701 Artificial Intelligence Fall 2013 Chapter 6: Constraint Satisfaction Problems Jonathan Voris (based on slides by Sal Stolfo) Assignment 3 Go Encircling Game Ancient Chinese game Dates back At
More informationMidterm Examination CS540-2: Introduction to Artificial Intelligence
Midterm Examination CS540-2: Introduction to Artificial Intelligence March 15, 2018 LAST NAME: FIRST NAME: Problem Score Max Score 1 12 2 13 3 9 4 11 5 8 6 13 7 9 8 16 9 9 Total 100 Question 1. [12] Search
More informationInformed search algorithms. Chapter 4
Informed search algorithms Chapter 4 Material Chapter 4 Section 1 - Exclude memory-bounded heuristic search 3 Outline Best-first search Greedy best-first search A * search Heuristics Local search algorithms
More informationArtificial Intelligence
Artificial Intelligence Dr Ahmed Rafat Abas Computer Science Dept, Faculty of Computers and Informatics, Zagazig University arabas@zu.edu.eg http://www.arsaliem.faculty.zu.edu.eg/ Informed search algorithms
More informationData Structures and Algorithms
Data Structures and Algorithms Session 26. April 29, 2009 Instructor: Bert Huang http://www.cs.columbia.edu/~bert/courses/3137 Announcements Homework 6 due before last class: May 4th Final Review May 4th
More informationDownloded from: CSITauthority.blogspot.com
[Unit : Searching] (CSC 355) Central Department of Computer Science & Information Technology Tribhuvan University 1 Searching search problem Figure below contains a representation of a map. The nodes represent
More informationInformatics 2D. Coursework 1: Search and Games
Informatics 2D. Coursework 1: Search and Games Stefanie Speichert, Vaishak Belle January 30, 2019 1 Introduction The objective of this assignment is to help you understand the various search algorithms
More informationUninformed Search. Day 1 & 2 of Search. Russel & Norvig Chap. 3. Material in part from
Uninformed Day & 2 of Russel & Norvig Chap. 3 Material in part from http://www.cs.cmu.edu/~awm/tutorials Examples of problems? The Oak Tree Informed versus Uninformed Heuristic versus Blind A Problem a
More informationLocal Search Methods. CS 188: Artificial Intelligence Fall Announcements. Hill Climbing. Hill Climbing Diagram. Today
CS 188: Artificial Intelligence Fall 2006 Lecture 5: Robot Motion Planning 9/14/2006 Local Search Methods Queue-based algorithms keep fallback options (backtracking) Local search: improve what you have
More informationUninformed Search. Reading: Chapter 4 (Tuesday, 2/5) HW#1 due next Tuesday
Uninformed Search Reading: Chapter 4 (Tuesday, 2/5) HW#1 due next Tuesday 1 Uninformed Search through the space of possible solutions Use no knowledge about which path is likely to be best Exception: uniform
More informationCS 520: Introduction to Artificial Intelligence. Lectures on Search
CS 520: Introduction to Artificial Intelligence Prof. Louis Steinberg Lecture : uninformed search uninformed search Review Lectures on Search Formulation of search problems. State Spaces Uninformed (blind)
More informationInformed search algorithms. (Based on slides by Oren Etzioni, Stuart Russell)
Informed search algorithms (Based on slides by Oren Etzioni, Stuart Russell) The problem # Unique board configurations in search space 8-puzzle 9! = 362880 15-puzzle 16! = 20922789888000 10 13 24-puzzle
More informationInformed search algorithms. Chapter 4
Informed search algorithms Chapter 4 Outline Best-first search Greedy best-first search A * search Heuristics Memory Bounded A* Search Best-first search Idea: use an evaluation function f(n) for each node
More informationWhat is Search For? CSE 473: Artificial Intelligence. Example: N-Queens. Example: N-Queens. Example: Map-Coloring 4/7/17
CSE 473: Artificial Intelligence Constraint Satisfaction Dieter Fox What is Search For? Models of the world: single agent, deterministic actions, fully observed state, discrete state space Planning: sequences
More informationTwo-player Games ZUI 2016/2017
Two-player Games ZUI 2016/2017 Branislav Bošanský bosansky@fel.cvut.cz Two Player Games Important test environment for AI algorithms Benchmark of AI Chinook (1994/96) world champion in checkers Deep Blue
More informationHEURISTIC SEARCH. 4.3 Using Heuristics in Games 4.4 Complexity Issues 4.5 Epilogue and References 4.6 Exercises
4 HEURISTIC SEARCH Slide 4.1 4.0 Introduction 4.1 An Algorithm for Heuristic Search 4.2 Admissibility, Monotonicity, and Informedness 4.3 Using Heuristics in Games 4.4 Complexity Issues 4.5 Epilogue and
More informationPractice Midterm Exam Solutions
CS 470/670 Introduction to AI Spring 2016 Instructor: Marc Pomplun Practice Midterm Exam Solutions Duration: 75 minutes Question 1: out of points Question 2: out of points Question 3: out of points Question
More informationState Space Search. Many problems can be represented as a set of states and a set of rules of how one state is transformed to another.
State Space Search Many problems can be represented as a set of states and a set of rules of how one state is transformed to another. The problem is how to reach a particular goal state, starting from
More informationMore Realistic Adversarial Settings. Virginia Tech CS5804 Introduction to Artificial Intelligence Spring 2015
More Realistic Adversarial Settings Virginia Tech CS5804 Introduction to Artificial Intelligence Spring 2015 Review Minimax search How to adjust for more than two agents, for non-zero-sum Analysis very
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence CSPs II + Local Search Prof. Scott Niekum The University of Texas at Austin [These slides based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.
More informationCS 188: Artificial Intelligence Spring Today
CS 188: Artificial Intelligence Spring 2006 Lecture 7: CSPs II 2/7/2006 Dan Klein UC Berkeley Many slides from either Stuart Russell or Andrew Moore Today More CSPs Applications Tree Algorithms Cutset
More informationArtificial Intelligence Class 3: Search (Ch ) Some material adopted from notes by Charles R. Dyer, University of Wisconsin-Madison
Artificial Intelligence Class 3: Search (Ch. 3.1 3.3) Some material adopted from notes by Charles R. Dyer, University of Wisconsin-Madison Dr. Cynthia Matuszek CMSC 671 Slides adapted with thanks from:
More informationTwo-player Games ZUI 2012/2013
Two-player Games ZUI 2012/2013 Game-tree Search / Adversarial Search until now only the searching player acts in the environment there could be others: Nature stochastic environment (MDP, POMDP, ) other
More informationAlpha-Beta Pruning in Mini-Max Algorithm An Optimized Approach for a Connect-4 Game
Alpha-Beta Pruning in Mini-Max Algorithm An Optimized Approach for a Connect-4 Game Rijul Nasa 1, Rishabh Didwania 2, Shubhranil Maji 3, Vipul Kumar 4 1,2,3,4 Dept. of Computer Science & Engineering, The
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence Constraint Satisfaction Problems II and Local Search Instructors: Sergey Levine and Stuart Russell University of California, Berkeley [These slides were created by Dan Klein
More informationClass Overview. Introduction to Artificial Intelligence COMP 3501 / COMP Lecture 2: Search. Problem Solving Agents
Class Overview COMP 3501 / COMP 4704-4 Lecture 2: Search Prof. 1 2 Problem Solving Agents Problem Solving Agents: Assumptions Requires a goal Assume world is: Requires actions Observable What actions?
More informationDIT411/TIN175, Artificial Intelligence. Peter Ljunglöf. 23 January, 2018
DIT411/TIN175, Artificial Intelligence Chapters 3 4: More search algorithms CHAPTERS 3 4: MORE SEARCH ALGORITHMS DIT411/TIN175, Artificial Intelligence Peter Ljunglöf 23 January, 2018 1 TABLE OF CONTENTS
More information2006/2007 Intelligent Systems 1. Intelligent Systems. Prof. dr. Paul De Bra Technische Universiteit Eindhoven
test gamma 2006/2007 Intelligent Systems 1 Intelligent Systems Prof. dr. Paul De Bra Technische Universiteit Eindhoven debra@win.tue.nl 2006/2007 Intelligent Systems 2 Informed search and exploration Best-first
More informationCS 188: Artificial Intelligence Spring Announcements
CS 188: Artificial Intelligence Spring 2006 Lecture 4: CSPs 9/7/2006 Dan Klein UC Berkeley Many slides over the course adapted from either Stuart Russell or Andrew Moore Announcements Reminder: Project
More informationCS 520: Introduction to Artificial Intelligence. Review
CS 520: Introduction to Artificial Intelligence Prof. Louis Steinberg Lecture 2: state spaces uninformed search 1 What is AI? A set of goals Review build an artificial intelligence useful subgoals A class
More informationARTIFICIAL INTELLIGENCE LECTURE 3. Ph. D. Lect. Horia Popa Andreescu rd year, semester 5
ARTIFICIAL INTELLIGENCE LECTURE 3 Ph. D. Lect. Horia Popa Andreescu 2012-2013 3 rd year, semester 5 The slides for this lecture are based (partially) on chapter 4 of the Stuart Russel Lecture Notes [R,
More informationMultiple Agents. Why can t we all just get along? (Rodney King) CS 3793/5233 Artificial Intelligence Multiple Agents 1
Multiple Agents Why can t we all just get along? (Rodney King) CS 3793/5233 Artificial Intelligence Multiple Agents 1 Assumptions Assumptions Definitions Partially bservable Each agent can act autonomously.
More informationOutline for today s lecture. Informed Search. Informed Search II. Review: Properties of greedy best-first search. Review: Greedy best-first search:
Outline for today s lecture Informed Search II Informed Search Optimal informed search: A* (AIMA 3.5.2) Creating good heuristic functions Hill Climbing 2 Review: Greedy best-first search: f(n): estimated
More informationMatching. Algorithms and Networks
Matching Algorithms and Networks This lecture Matching: problem statement and applications Bipartite matching (recap) Matching in arbitrary undirected graphs: Edmonds algorithm Diversion: generalized tic-tac-toe
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 4. Informed Search Methods Heuristics, Local Search Methods, Genetic Algorithms Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität
More informationArtificial Intelligence. Chapters Reviews. Readings: Chapters 3-8 of Russell & Norvig.
Artificial Intelligence Chapters Reviews Readings: Chapters 3-8 of Russell & Norvig. Topics covered in the midterm Solving problems by searching (Chap. 3) How to formulate a search problem? How to measure
More informationArtificial Intelligence
Artificial Intelligence CS482, CS682, MW 1 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis, sushil@cse.unr.edu, http://www.cse.unr.edu/~sushil Informed Search Best First Search A*
More informationArtificial Intelligence
Artificial Intelligence Information Systems and Machine Learning Lab (ISMLL) Tomáš Horváth 10 rd November, 2010 Informed Search and Exploration Example (again) Informed strategy we use a problem-specific
More informationARTIFICIAL INTELLIGENCE (CSC9YE ) LECTURES 2 AND 3: PROBLEM SOLVING
ARTIFICIAL INTELLIGENCE (CSC9YE ) LECTURES 2 AND 3: PROBLEM SOLVING BY SEARCH Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Problem solving by searching Problem formulation Example problems Search
More informationCSE 473: Ar+ficial Intelligence Uncertainty and Expec+max Tree Search
CSE 473: Ar+ficial Intelligence Uncertainty and Expec+max Tree Search Instructors: Luke ZeDlemoyer Univeristy of Washington [These slides were adapted from Dan Klein and Pieter Abbeel for CS188 Intro to
More informationCSE 203A: Randomized Algorithms
CSE 203A: Randomized Algorithms (00:30) The Minimax Principle (Ch 2) Lecture on 10/18/2017 by Daniel Kane Notes by Peter Greer-Berezovsky Game Tree Evaluation (2.1) - n round deterministic 2-player game
More informationAnnouncements. CS 188: Artificial Intelligence Spring Production Scheduling. Today. Backtracking Search Review. Production Scheduling
CS 188: Artificial Intelligence Spring 2009 Lecture : Constraint Satisfaction 2/3/2009 Announcements Project 1 (Search) is due tomorrow Come to office hours if you re stuck Today at 1pm (Nick) and 3pm
More informationCS 188: Artificial Intelligence Fall 2008
CS 188: Artificial Intelligence Fall 2008 Lecture 4: CSPs 9/9/2008 Dan Klein UC Berkeley Many slides over the course adapted from either Stuart Russell or Andrew Moore 1 1 Announcements Grading questions:
More informationAnnouncements. CS 188: Artificial Intelligence Fall Large Scale: Problems with A* What is Search For? Example: N-Queens
CS 188: Artificial Intelligence Fall 2008 Announcements Grading questions: don t panic, talk to us Newsgroup: check it out Lecture 4: CSPs 9/9/2008 Dan Klein UC Berkeley Many slides over the course adapted
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence Constraint Satisfaction Problems II Instructors: Dan Klein and Pieter Abbeel University of California, Berkeley [These slides were created by Dan Klein and Pieter Abbeel
More informationEE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 3, 4/6/2005 University of Washington, Department of Electrical Engineering Spring 2005 Instructor: Professor Jeff A. Bilmes 4/6/2005 EE562 1 Today: Basic
More informationCS347 FS2003 Final Exam Model Answers
CS347 FS003 Final Exam Model Answers This is a closed-book test. The only item not supplied that you are allowed (and required) to use, is a pen or pencil. Mark all paper you use with your name, the date,
More informationSolving Problems: Blind Search
Solving Problems: Blind Search Instructor: B. John Oommen Chancellor s Professor Fellow: IEEE ; Fellow: IAPR School of Computer Science, Carleton University, Canada The primary source of these notes are
More informationK-Consistency. CS 188: Artificial Intelligence. K-Consistency. Strong K-Consistency. Constraint Satisfaction Problems II
CS 188: Artificial Intelligence K-Consistency Constraint Satisfaction Problems II Instructor: Marco Alvarez University of Rhode Island (These slides were created/modified by Dan Klein, Pieter Abbeel, Anca
More informationDownloaded from ioenotes.edu.np
Chapter- 3: Searching - Searching the process finding the required states or nodes. - Searching is to be performed through the state space. - Search process is carried out by constructing a search tree.
More informationSolving Problem by Searching. Chapter 3
Solving Problem by Searching Chapter 3 Outline Problem-solving agents Problem formulation Example problems Basic search algorithms blind search Heuristic search strategies Heuristic functions Problem-solving
More informationAlgorithms & Complexity
Algorithms & Complexity Nicolas Stroppa - nstroppa@computing.dcu.ie CA313@Dublin City University. 2006-2007. November 21, 2006 Classification of Algorithms O(1): Run time is independent of the size of
More informationDIT411/TIN175, Artificial Intelligence. Peter Ljunglöf. 6 February, 2018
DIT411/TIN175, Artificial Intelligence Chapters 5, 7: Search part IV, and CSP, part II CHAPTERS 5, 7: SEARCH PART IV, AND CSP, PART II DIT411/TIN175, Artificial Intelligence Peter Ljunglöf 6 February,
More informationOutline for today. Logic Programming. Search problems. Search spaces. Problem representation Depth-First Search
Logic Programming Lecture 7: Search Strategies: Problem representations Depth-first, breadth-first, and ND/OR search Outline for today Problem representation Depth-First Search Iterative Deepening readth-first
More informationAnnouncements. Homework 4. Project 3. Due tonight at 11:59pm. Due 3/8 at 4:00pm
Announcements Homework 4 Due tonight at 11:59pm Project 3 Due 3/8 at 4:00pm CS 188: Artificial Intelligence Constraint Satisfaction Problems Instructor: Stuart Russell & Sergey Levine, University of California,
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 4. Informed Search Methods Heuristics, Local Search Methods, Genetic Algorithms Joschka Boedecker and Wolfram Burgard and Frank Hutter and Bernhard Nebel Albert-Ludwigs-Universität
More informationIntroduction. 2D1380 Constraint Satisfaction Problems. Outline. Outline. Earlier lectures have considered search The goal is a final state
CS definition 2D1380 Constraint Satisfaction roblems CS definition Earlier lectures have considered search The goal is a final state CSs CSs There was no internal structure to the problem or states States
More informationAnnouncements. CS 188: Artificial Intelligence Fall Robot motion planning! Today. Robotics Tasks. Mobile Robots
CS 188: Artificial Intelligence Fall 2007 Lecture 6: Robot Motion Planning 9/13/2007 Announcements Project 1 due (yesterday)! Project 2 (Pacman with ghosts) up in a few days Reminder: you are allowed to
More informationCS 188: Artificial Intelligence Fall Announcements
CS 188: Artificial Intelligence Fall 2007 Lecture 6: Robot Motion Planning 9/13/2007 Dan Klein UC Berkeley Many slides over the course adapted from either Stuart Russell or Andrew Moore Announcements Project
More informationGames and Adversarial Search II Alpha-Beta Pruning (AIMA 5.3)
Games and Adversarial Search II Alpha-Beta Pruning (AIMA 5.) Some slides adapted from Richard Lathrop, USC/ISI, CS 7 Review: The Minimax Rule Idea: Make the best move for MAX assuming that MIN always replies
More informationHomework #6 (Constraint Satisfaction, Non-Deterministic Uncertainty and Adversarial Search) Out: 2/21/11 Due: 2/29/11 (at noon)
CS121 Introduction to Artificial Intelligence Winter 2011 Homework #6 (Constraint Satisfaction, Non-Deterministic Uncertainty and Adversarial Search) Out: 2/21/11 Due: 2/29/11 (at noon) How to complete
More information