CPSC 433 Artificial Intelligence Search Modeling Practice Problems M. Reza Zakerinasab Please include [CPSC433] in the subject line.

Slides:



Advertisements
Similar presentations
Spreadsheet Vocabulary
Advertisements

Spreadsheet Vocabulary Split the screen so you can see the words AND the crossword puzzle AND the quiz at the same time.
Cooperating Intelligent Systems
The Algorithmic problems?
CPSC 433 Artificial Intelligence Or-Tree Modeling Example CPSC 433 T01 & T02 Andrew Kuipers.
1.2 Points, Lines, and Planes
Set Based Search Modeling Examples II
Algorithmic Software Verification II. Modeling using FSA.
Formal Description of a Problem
State Space Search Classic AI.
SEARCH APPLICATIONS David Kauchak CS30 – Spring 2015.
Problem of the Day Problem of the Day next Geometry - Connect the Dots
CPSC 433 Artificial Intelligence And-Tree Search Modeling Example – Model Elimination CPSC 433 T01 & T02 Andrew Kuipers.
Artificial Intelligence Problem solving by searching CSC 361
State-Space Searches. State spaces A state space consists of –A (possibly infinite) set of states The start state represents the initial problem Each.
Artificial Intelligence
Toy Problem: Missionaries and Cannibals
Computer Science 6/13/2015CPSC 433: Other Search Models and Processes 1 CPSC Artificial Intelligence Winter 2006 Search Paradigms: Search Summary.
Problem solving by Searching Problem Formulation.
Intelligent agents Intelligent agents are supposed to act in such a way that the environment goes through a sequence of states that maximizes the performance.
Intelligent agents Intelligent agents are supposed to act in such a way that the environment goes through a sequence of states that maximizes the performance.
Graphs and Trees More examples on Total degree of a graph Applications of Graphs.
CPSC 433 Artificial Intelligence CPSC 433 : Artificial Intelligence Tutorials T01 & T02 Andrew “M” Kuipers note: please include.
Artificial Intelligence Problem solving by searching CSC 361 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
Multiplication of Real Numbers Section Multiplication When you first learned multiplication, your book had pictures of equal number of objects.
Examining the top three rows first Row two requires a 5. It has to be located in the middle 3x3 box. Two possible locations for 5 in centre box The centre.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 13– Search.
start 3 missionaries and 3 cannibals Cannibal & Cannibal Missionary & Missionary Cannibal & Missionary Which one we should move first You lose True.
Solving Problems by Searching
State-Space Searches.
Create a Crossword. You should have 24 personal vocabulary words from your reading of Chew on This. You will use at least 20 of them to make a crossword.
Introduction to Programming Doman’s Lecture CSCI101.
Least Common Multiple and Equivalent Fractions Slide 1

1 State Space of a Problem Lecture 03 ITS033 – Programming & Algorithms Asst. Prof.
Introduction to Programming Initial Slides developed by Dr. Doman.
State Space Search. State Space representation of a problem is a graph  Nodes correspond to problem states  Arcs correspond to steps in a solution process.
Basic concepts of Searching
State-Space Searches. 2 State spaces A state space consists of A (possibly infinite) set of states The start state represents the initial problem Each.
Code Design Using Functions CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
PROBLEM SOLVING – BASIC SEARCH METHODS 12/8/2015Dr. Sunil Kumar 1.
Problem Solving Agents
CPSC 433 Artificial Intelligence Rule Based Systems (Prolog) M. Reza Zakerinasab Please include [CPSC433] in the subject line of any.
Knowledge Representation Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 13– Search 17 th August, 2010.
CPSC 433 Artificial Intelligence Set Based Search Modeling Examples Andrew Kuipers Please include [CPSC433] in the subject line.
1/16 Problem solving by Searching Problem Formulation.
Checkers A Matlab Project by Spenser Davison, Edward Dyakiw, Justin Pezzi, and Scott Wu.
State space search Represented by a four-tuple [N,A,S,GD], where: N is the problem space A is the set of arcs (or links) between nodes. These correspond.
CPSC 433 Artificial Intelligence Unification & Resolution Examples Andrew Kuipers Please include [CPSC433] in the subject line.
Here is a small example of the puzzle you will be completing today. You will start in the top left corner, and end at the bottom right using 3 different.
We do it for the glory #allbrains #Advancedgeoisthebest #Ms.uckar #thereisalsoextracreditinvolved.
Knowledge Representation
Problem solving by Searching
Introduction to Artificial Intelligence
David Kauchak CS30 – Spring 2016
Chapter 4 Matching.
CPSC 433 : Artificial Intelligence Tutorials T01 & T02
Plotting Points Guided Notes
Puzzle A Puzzle B.
Knowledge Representation
Artificial Intelligence
State-Space Searches.
State-Space Searches.
Maps one figure onto another figure in a plane.
David Kauchak CS51A – Spring 2019
State-Space Searches.
Snakes and Ladders Game with Science
Jug Problem by C-language
missionaries-and-cannibals problem
Presentation transcript:

CPSC 433 Artificial Intelligence Search Modeling Practice Problems M. Reza Zakerinasab Please include [CPSC433] in the subject line of any s regarding this course. Slides originally created by Andrew M Kuipers.

CPSC 433 Artificial Intelligence What we need? Facts & States Search Modeling Paradigm Set based Search Modeling –Extension Rules And-tree Search Modeling –Erw  ((pr, ?), (pr, yes)) –Div function Or-tree Search Modeling –Erw  ((pr, ?), (pr, yes)) & Erw  ((pr, ?), (pr, no)) –Altern function

CPSC 433 Artificial Intelligence 8 Puzzle Classic “Sliding Boxes” puzzle –Re-arrange numbered tiles so that numbers are sequentially ordered (left-to-right) in box –Can only move tiles into the empty space from horizontally or vertically adjacent spaces

CPSC 433 Artificial Intelligence 4L 3L Water Jugs Goal: get exactly 2L into the 4L jug Allowable Actions: –Fill either jug completely –Empty either jug onto the ground –Empty one jug into the other –Top off one jug from the other

CPSC 433 Artificial Intelligence Missionaries and Cannibals There are N (where N  1) missionaries and N cannibals on the left bank of a river They have a rowboat with them, which can carry a maximum of two people, and needs at least one person to row across the river If there are one or more missionaries on a river bank, there cannot be more cannibals than missionaries on that bank How can all missionaries and cannibals be transported across the river?