Depth First Search Prof. S M Lee Department of Computer Science.

Slides:



Advertisements
Similar presentations
Fermat’s Last Theorem Dr. S. Lawrence ©2005.
Advertisements

Complexity. P=NP? Who knows? Who cares? Lets revisit some questions from last time – How many pairwise comparisons do I need to do to check if a sequence.
Heuristic Search techniques
AI Pathfinding Representing the Search Space
Intelligence Artificial Intelligence Ian Gent Search: 1.
An overview of assessing pupils progress
Copyright 2003, Christine L. Abela, M.Ed. I’m failing… help! Straight facts to help you try to rebound!
11 Human Competitive Results of Evolutionary Computation Presenter: Mati Bot Course: Advance Seminar in Algorithms (Prof. Yefim Dinitz)
Backtrack Algorithm for Listing Spanning Trees R. C. Read and R. E. Tarjan (1975) Presented by Levit Vadim.
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Department of Computer Science & Engineering
1 Hypothesis Testing Chapter 8 of Howell How do we know when we can generalize our research findings? External validity must be good must have statistical.
Present perfect v Past simple
9.2 The Traveling Salesman Problem. Let us return to the question of finding a cheapest possible cycle through all the given towns: We have n towns (points)
Computability and Complexity 13-1 Computability and Complexity Andrei Bulatov The Class NP.
One Hull of A Rain Forest Green Computing Computer Science Neil Gordon January
Tractable and intractable problems for parallel computers
CS5371 Theory of Computation Lecture 11: Computability Theory II (TM Variants, Church-Turing Thesis)
1 Polynomial Church-Turing thesis A decision problem can be solved in polynomial time by using a reasonable sequential model of computation if and only.
MAE 552 – Heuristic Optimization Lecture 27 April 3, 2002
Algorithmic Problems in Algebraic Structures Undecidability Paul Bell Supervisor: Dr. Igor Potapov Department of Computer Science
Two Discrete Optimization Problems Problem #2: The Minimum Cost Spanning Tree Problem.
Graphs and Euler cycles Let Maths take you Further…
Design & Analysis of Algorithms Introduction. Introduction Algorithms are the ideas behind computer programs. An algorithm is the thing which stays the.
Nicolaus Copernicus (2/19/1473-5/24/1543) was a Polish mathematician, astronomer, jurist, physician, classical scholar, governor, administrator, military.
1.1 Chapter 1: Introduction What is the course all about? Problems, instances and algorithms Running time v.s. computational complexity General description.
Solving Systems of Linear Equations by Graphing
Introduction to complexity Prof. Sin-Min Lee Department of Computer Science San Jose State University.
Tonga Institute of Higher Education Design and Analysis of Algorithms IT 254 Lecture 8: Complexity Theory.
E - Physical Sciences & Engineering Jeff Pache IEE
Data Structures Week 9 Introduction to Graphs Consider the following problem. A river with an island and bridges. The problem is to see if there is a way.
Dr.Abeer Mahmoud ARTIFICIAL INTELLIGENCE (CS 461D) Dr. Abeer Mahmoud Computer science Department Princess Nora University Faculty of Computer & Information.
Chapter 9: Rules and Expert Systems Lora Streeter.
Instructor: Shengyu Zhang 1. Tractable While we have introduced many problems with polynomial-time algorithms… …not all problems enjoy fast computation.
ANCHOR ACTIVITIES KATIE JACKLETT EDU NOVEMBER 2010.
Objectives – The Student will: 1.Name and explain the steps in the problem- solving process. 2.Solve a problem by applying the problem-solving process.
Youth Culture Lesson Finding Teachable Moments in Culture From YouthWorker Journal and YouthWorker.com No Lie Fibs Have a Way of Growing By Paul Asay.
Explorers need maps: Abstraction, representations and graphs Paul Curzon Queen Mary University of London
Basic Problem Solving Search strategy  Problem can be solved by searching for a solution. An attempt is to transform initial state of a problem into some.
NP-complete Problems Prof. Sin-Min Lee Department of Computer Science.
Moose Math Day 1. What’s Happening? 1. Jamie’s family visited their grandmother, who lives 634 miles from their house. On the first day, they drove 319.
October, Complete the sentences 1) We ___________ in a restaurant in May (to work) 2) Jack ____________________ the window of the gym this.
Science Basics SNC2D. What is Science? When asked this question most students would immediately start to visualize Albert Einstein. But, is that what.
Sight Words.
Warm Up 1)Find the 43 rd term of the sequence 47, 34, 21, 8, …. 2)Rewrite in slope-intercept form -5y + 3x = -9.
2101INT – Principles of Intelligence Systems Lecture 3.
Complexity © 2014 Project Lead The Way, Inc.Computer Science and Software Engineering.
A* optimality proof, cycle checking CPSC 322 – Search 5 Textbook § 3.6 and January 21, 2011 Taught by Mike Chiang.
CS216: Program and Data Representation University of Virginia Computer Science Spring 2006 David Evans Lecture 8: Crash Course in Computational Complexity.
René Descartes Brandon Lee Block D.
FRY PHRASES Learn these words and you will be well on your way to becoming a great reader!!!
Unit One Making a difference Warming up Talk about science and scientists.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 23: Intractable Problems (Smiley Puzzles.
SUDOKU SOLVER Will Bazil, Ryan Covert, Ricky Parker.
Mere Christianity C. S. Lewis. The Law of Human Nature Chapter 1 Two basic points: –Human beings, all over the earth, have this curious idea that they.
Information for Parents 3 rd May Key Stage 2 SATs Changes In 2014/15 a new national curriculum framework was introduced by the government for Years.
B1 Exam Tips Feedback from the examiners The examiner says…
Complexity of Determining Nonemptiness of the Core
Data Structures Lab Algorithm Animation.
Mathematical Kaleidoscope
CPSC 411 Design and Analysis of Algorithms
Possibilities and Limitations in Computation
Analysis and design of algorithm
CLASSES P AND NP.
Chapter 11 Limitations of Algorithm Power
CPSC 411 Design and Analysis of Algorithms
Fact and Opinion: Is There Really a Difference
15th Scandinavian Workshop on Algorithm Theory
CS 150: Computing - From Ada to the Web
Problem Solving Objectives: The student will be able to:
Presentation transcript:

Depth First Search Prof. S M Lee Department of Computer Science

''Nothing in life is to be feared. It is only to be understood.'' - Marie Curie

Games Problem: a position in a Chess/Go/ … game Solution: a strategy to guarantee winning game Harder than NP problems it is not easy to check that a strategy wins

Presenting Search Abstractly Helps to understand the abstract nature of search search states, search spaces, search trees … know what particular search algorithms are trying to do There are two kinds of search algorithm Complete guaranteed to find solution or prove there is none Incomplete may not find a solution even when it exists often more efficient (or there would be no point) e.g. Genetic Algorithms For now concerned with complete algorithms

Search States Search states summarises the state of search A solution tells us everything we need to know e.g. in SAT, whether each letter is UPPER or lower case in TSP, route taken round nodes of graph This is a (special) example of a search state it contains complete information it solves the problem In general a search state may not do either of those it may not specify everything about a possible solution it may not solve the problem or extend to a solution

Norbert Wiener N. Wiener drove 150 miles to a math conference at Yale University. When the conference was over, he forgot he came by car, so he returned home by bus. The next morning, he went out to his garage to get his car, discovered it was missing, and complained the police that while he was away, someone stole his car. Yuk Wing Lee (left),Amar G. Bose and Norbert Wiener

"We mathematicians who operate with nothing more expensive than paper and possibly printers' ink are quite reconciled to the fact that, if we are working in an active field, our discoveries will commence to be obsolete at the moment that they are written down or even at the moment they are conceived. We know that for a long time everything we do will be nothing more than the jumping off point for those who have the advantage of already being aware of our ultimate results. This is the meaning of the famous apothegm of Newton, when he said, "If I have seen further than other men, it is because I have stood on the shoulders of giants". (Nobert Wiener, “I am a Mathematician” )

Sometimes we discover unpleasant truths. Whenever we do so, we are in difficulties: suppressing them is scientifically dishonest, so we must tell them, but telling them, however, will fire back on us. If the truths are sufficiently impalatable, our audience is psychically incapable of accepting them and we will be written off as totally unrealistic, hopelessly idealistic, dangerously revolutionary, foolishly gullible or what have you. (Besides that, telling such truths is a sure way of making oneself unpopular in many circles, and, as such, it is an act that, in general, is not without personal risks. Vide Galileo Galilei.....) --- Edsger W.Dijkstra 18th June 1975 Edsger W.Dijkstra ( August 2002), died in cancer