Presentation is loading. Please wait.

Presentation is loading. Please wait.

SEG 4560 Midterm Review.

Published byพรรณี สมิธ Modified over 5 years ago

Similar presentations

Presentation on theme: "SEG 4560 Midterm Review."— Presentation transcript:

1 SEG 4560 Midterm Review

2 Midterm In class, 4:30-6:15pm, March 09, 2009
5 Questions from Chapters 3-8 One A4 size cheat sheet Useful materials: Tutorials 1 and 2, Assignments 1 and 2, and Lecture notes

3 Chapters 7 and 8 Express sentences in Propositional logic
First-order logic Connectives Logical equivalence Forward chaining, backward chaining Resolution algorithm

4 Chapter 6 Minimax algorithm Alpha-beta algorithm
Minimax of nondeterministic games

5 Chapter 5 CSPs Backtracking search for CSPs
Variables Domains Constraints Backtracking search for CSPs Various heuristics to speedup search

6 Chapter 4 Greedy search and A* search Local search
Evaluation function, admissible heuristic Local search Hill-climbing Properties of these search methods Efficiency Completeness Optimality

7 Chapter 3 Breadth-first search Uniform-cost search Depth-first search
Depth-limited search Iterative deepening search Properties and Comparisons Efficiency Space Completeness Optimality

Download ppt "SEG 4560 Midterm Review."

Similar presentations

Big Ideas in Cmput366. Search Blind Search State space representation Iterative deepening Heuristic Search A*, f(n)=g(n)+h(n), admissible heuristics Local.

Big Ideas in Cmput366. Search Blind Search State space representation Iterative deepening Heuristic Search A*, f(n)=g(n)+h(n), admissible heuristics Local.
Local Search Jim Little UBC CS 322 – CSP October 3, 2014 Textbook §4.8

Local Search Jim Little UBC CS 322 – CSP October 3, 2014 Textbook §4.8
Local Search Algorithms Chapter 4. Outline Hill-climbing search Simulated annealing search Local beam search Genetic algorithms Ant Colony Optimization.

Local Search Algorithms Chapter 4. Outline Hill-climbing search Simulated annealing search Local beam search Genetic algorithms Ant Colony Optimization.
CSC411Artificial Intelligence 1 Chapter 3 Structures and Strategies For Space State Search Contents Graph Theory Strategies for Space State Search Using.

CSC411Artificial Intelligence 1 Chapter 3 Structures and Strategies For Space State Search Contents Graph Theory Strategies for Space State Search Using.
Greedy best-first search Use the heuristic function to rank the nodes Search strategy –Expand node with lowest h-value Greedily trying to find the least-cost.

Greedy best-first search Use the heuristic function to rank the nodes Search strategy –Expand node with lowest h-value Greedily trying to find the least-cost.
1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)

1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)
Search I: Chapter 3 Aim: achieving generality Q: how to formulate a problem as a search problem?

Search I: Chapter 3 Aim: achieving generality Q: how to formulate a problem as a search problem?
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)

Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Methods of Proof Chapter 7, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.

Methods of Proof Chapter 7, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.
Chapter 4 Search Methodologies.

Chapter 4 Search Methodologies.
159.3021 Lecture 12 Last time: CSPs, backtracking, forward checking Today: Game Playing.

Lecture 12 Last time: CSPs, backtracking, forward checking Today: Game Playing.
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.

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.
159.3021 Lecture 13 Last time: Games, minimax, alpha-beta Today: Finish off games, summary.

Lecture 13 Last time: Games, minimax, alpha-beta Today: Finish off games, summary.
Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.

Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.
Chapter 14 An Overview of Query Optimization. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. 11-2 Figure 14.1 Typical architecture for.

Chapter 14 An Overview of Query Optimization. Copyright © 2005 Pearson Addison-Wesley. All rights reserved Figure 14.1 Typical architecture for.
Midterm Review CMSC421 – Fall 2006. CH1 Summary: Intro AI Definitions: dimensions human/rational think/act Three Major Components of AI Algorithms Representation.

Midterm Review CMSC421 – Fall CH1 Summary: Intro AI Definitions: dimensions human/rational think/act Three Major Components of AI Algorithms Representation.
1 Using Search in Problem Solving Part II. 2 Basic Concepts Basic concepts: Initial state Goal/Target state Intermediate states Path from the initial.

1 Using Search in Problem Solving Part II. 2 Basic Concepts Basic concepts: Initial state Goal/Target state Intermediate states Path from the initial.
1 Chapter 4 Search Methodologies. 2 Chapter 4 Contents l Brute force search l Depth-first search l Breadth-first search l Properties of search methods.

1 Chapter 4 Search Methodologies. 2 Chapter 4 Contents l Brute force search l Depth-first search l Breadth-first search l Properties of search methods.
Chapter 5 Trees. 2 5.1 PROPERTIES OF TREES 3 4.

Chapter 5 Trees PROPERTIES OF TREES 3 4.
Big Ideas in Cmput366. Search Blind Search Iterative deepening Heuristic Search A* Local and Stochastic Search Randomized algorithm Constraint satisfaction.

Big Ideas in Cmput366. Search Blind Search Iterative deepening Heuristic Search A* Local and Stochastic Search Randomized algorithm Constraint satisfaction.

Similar presentations

Ads by Google