Intro to Computation & AI

10/30/97


Click here to start


Table of Contents

Intro to Computation & AI

Recursion: Review

Simple Example

Abstractly

Example: Multiple Returns

Analysis of Algorithms

Example: Sorting

O-notation

O-notation Factoids

Trading Space for Time: List to Tree

Trading Space for Time: List to Tree

Trading Space for Time: List to Tree

Trading Space for Time: Tree to Vector

Trading Space for Time: Tree to Vector

Trees, Recursion, Complexity, & Trade-offs: Tic-tac-toe

Game Tree Representation: Data

Game Tree Representation: Procedures

Expansion via Recursion

Problem Space/State Space Search

Search in Tic-tac-toe

Exhaustive MiniMax Search

Recursive Exhaustive MiniMax

Playing the Game

Trading Time/Space

Hash Tables

Bubbleup with Hashing

Who Cares About Complexity?

Heuristic Search Methods

Author: Philip Lehman

Email: jeffreys@andrew.cmu.edu