Approaches to search Simple search Heuristic search Genetic search

Slides:

Advertisements

Similar presentations

Course Overview What is AI? What are the Major Challenges? What are the Main Techniques? Where are we failing, and why? Step back and look at the Science.

Advertisements

Ch 4. Heuristic Search 4.0 Introduction(Heuristic)

Search I: Chapter 3 Aim: achieving generality Q: how to formulate a problem as a search problem?

Traveling Salesperson Problem

Heuristics Some further elaborations of the art of heuristics and examples.

Heuristics CPSC 386 Artificial Intelligence Ellen Walker Hiram College.

Adversarial Search Reference: “Artificial Intelligence: A Modern Approach, 3 rd ed” (Russell and Norvig)

STRATEGI PENCARIAN DENGAN INFORMASI (INFORMED SEARCH STRATEGY)

Strategi Pencarian dengan Informasi (Informed Search Strategy)

For Friday Finish chapter 5 Program 1, Milestone 1 due.

Artificial Intelligence Adversarial search Fall 2008 professor: Luigi Ceccaroni.

Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler.

Lecture 12 Last time: CSPs, backtracking, forward checking Today: Game Playing.

MINIMAX SEARCH AND ALPHA- BETA PRUNING: PLAYER 1 VS. PLAYER 2.

Adversarial Search Board games. Games 2 player zero-sum games Utility values at end of game – equal and opposite Games that are easy to represent Chess.

Breadth First Search

Min-Max Trees Based on slides by: Rob Powers Ian Gent Yishay Mansour.

1 search CS 331/531 Dr M M Awais A* Examples:. 2 search CS 331/531 Dr M M Awais 8-Puzzle f(N) = g(N) + h(N)

Find a Path s A D B E C F G Heuristically Informed Methods  Which node do I expand next?  What information can I use to guide this.

Applying Genetic Programming to Stratego Ryan Albarelli.

Monotonicity Admissible Search: “That finds the shortest path to the Goal” Monotonicity: local admissibility is called MONOTONICITY This property ensures.

Adversarial Search and Game Playing Examples. Game Tree MAX’s play  MIN’s play  Terminal state (win for MAX)  Here, symmetries have been used to reduce.

Search  Exhaustive/Blind Search Methods Depth First Search Breadth First Search  Heuristic Methods Hill Climbing Beam Search Best First Search…

Game Playing: Adversarial Search Chapter 6. Why study games Fun Clear criteria for success Interesting, hard problems which require minimal “initial structure”

1 Adversary Search Ref: Chapter 5. 2 Games & A.I. Easy to measure success Easy to represent states Small number of operators Comparison against humans.

873 8 [8,.] [.,8] [9,.] 8 [.,8] 24 [2,.] 1 [4,.]4 4.

Traditional game playing 2 player adversarial (win => lose) based on search but... huge game trees can't be fully explored.

Chapter 6 Adversarial Search. Adversarial Search Problem Initial State Initial State Successor Function Successor Function Terminal Test Terminal Test.

Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.

Game Playing. Introduction One of the earliest areas in artificial intelligence is game playing. Two-person zero-sum game. Games for which the state space.

For Friday Finish chapter 6 Program 1, Milestone 1 due.

GAME PLAYING 1. There were two reasons that games appeared to be a good domain in which to explore machine intelligence: 1.They provide a structured task.

Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.

KNOWLEDGE BASED SYSTEMS

Knowledge Search CPTR 314.

ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.

CMSC 421: Intro to Artificial Intelligence October 6, 2003 Lecture 7: Games Professor: Bonnie J. Dorr TA: Nate Waisbrot.

Adversarial Search 2 (Game Playing)

Parallel Programming in Chess Simulations Part 2 Tyler Patton.

D Goforth - COSC 4117, fall OK administrivia  Exam format – take home, open book  Suicide rule for King’s court Illegal moves cannot move last.

CS-424 Gregory Dudek Lecture 10 Annealing (final comments) Adversary Search Genetic Algorithms (genetic search)

Search: Games & Adversarial Search Artificial Intelligence CMSC January 28, 2003.

Adversarial Search Chapter Two-Agent Games (1) Idealized Setting – The actions of the agents are interleaved. Example – Grid-Space World – Two.

Lecture 3 Problem Solving through search Uninformed Search

Adversarial Search and Game-Playing

Last time: search strategies

AI Classnotes #5, John Shieh, 2012

CS 460 Spring 2011 Lecture 4.

Review of AI Professor: Liqing Zhang

Done Done Course Overview What is AI? What are the Major Challenges?

Heuristic Search A heuristic is a rule for choosing a branch in a state space search that will most likely lead to a problem solution Heuristics are used.

The Implementation of Machine Learning in the Game of Checkers

CSE 4705 Artificial Intelligence

Artificial Intelligence Chapter 12 Adversarial Search

Chapter 6 : Game Search 게임 탐색 (Adversarial Search)

Announcements Homework 3 due today (grace period through Friday)

Tutorial 5 Adversary Search

Kevin Mason Michael Suggs

NIM - a two person game n objects are in one pile

Search and Game Playing

Lecture 9 Administration Heuristic search, continued

Based on slides by: Rob Powers Ian Gent

Progressive Deepening

Adversarial Search and Game Playing Examples

SEG 4560 Midterm Review.

Games & Adversarial Search

Presentation transcript:

Approaches to search Simple search Heuristic search Genetic search Depth-first search Breadth-first search Heuristic search Hill-climbing Best-first search Branch-and-bound search A* Genetic search Adversarial search 2019年4月6日 Search

Depth-first search A B C D A E  G H I 2019年4月6日 Search

Breadth-first search A B C D A E B F G H I J K L 2019年4月6日 Search

Hill-climbing A B C D A E B F G H I J K 20? 15? 16? 18? 17? 13? 15? 12? 14? 8? 2? 2019年4月6日 Search

Best-first search A B C D A E B F J K 20? 15? 16? 18? 17? 13? 15? 8? 2? 2019年4月6日 Search

Branch-and-bound search 1 4 D A F H G 2 3 4 5 9 I J K L M 7 9 6 9 10 7 8 2019年4月6日 Search

 A* A B C C D E H I J >5 1 4 >5 >3 2 3 4 >3 >4 8 9 7 >1 2019年4月6日 Search

Genetic search A B C D E F G H I J K L M N O P W X S T U V Q R 2019年4月6日 Search

Adversarial search: minimax maximizing 6 minimizing 5 6 3 maximizing 5 9 9 6 5 9 3 4 5 9 2 1 9 4 2 6 5 3 9 3 2 3 2019年4月6日 Search

Adversarial search: minimax + alpha-beta maximizing ≥5 ≥6 6 minimizing ≤5 5 6 ≤5 maximizing 5 ≥9 9 6 5 4 5 9 1 9 4 2 6 5 3 2019年4月6日 Search