'Heuristic h' presentation slideshows

CS 4700: Foundations of Artificial Intelligence

CS 4700: Foundations of Artificial Intelligence. Bart Selman selman@cs.cornell.edu Module: Informed Search Readings R&N - Chapter 3: 3.5 and 3.6. Search. Search strategies determined by choice of node (in queue) to expand Uninformed search: Distance to goal not taken into account

819 views • 70 slides

Review: Search problem formulation

Review: Search problem formulation. Initial state Actions Transition model Goal state Path cost What is the optimal solution? What is the state space?. Review: Tree search. Initialize the fringe using the starting state While the fringe is not empty

679 views • 59 slides

Modern Planning Techniques

565 views • 44 slides

Classic AI Search Problems

Classic AI Search Problems Sliding tile puzzles 8 Puzzle (3 by 3 variation) Small number of 8!/2, about 1.8 *10 5 states 15 Puzzle (4 by 4 variation) Large number of 16!/2 , about 1.0 *10 13 states 24 Puzzle (5 by 5 variation) Huge number of 25!/2 , about 7.8 *10 25 states

1.25k views • 43 slides

Artificial Intelligence

480 views • 38 slides

Problem-solving as search

594 views • 37 slides

Notes

527 views • 34 slides

Towers of Hanoi

Quiz Tu. Oct.20. Towers of Hanoi. The objective of the puzzle is to move the entire stack to another rod, obeying the following rules: * Only one disk may be moved at a time.

389 views • 2 slides