Explore a comprehensive lecture on artificial intelligence focusing on the A* search algorithm and its implementation. Dive into key concepts including node classes, grid structures, action costs, legal moves, object sizing, path costs, and heuristic functions. Examine connected states and learn techniques for computing connectivity. Discover various speed optimization strategies for improving algorithm performance. Get hands-on experience with a GUI demo and receive step-by-step code instructions for completing the related assignment. Gain valuable insights into AI problem-solving techniques applied to simple games in this introductory computer science course.
Introduction to Artificial Intelligence: A* Search Algorithm and Optimizations - Lecture 6
Overview
Syllabus
- Intro
- Lecture Start
- New in Assignment 2
- A* Search Algorithm Code
- Node Class
- Grid, Actions, Costs
- Legal Actions
- Object Sizes, Can Fit
- Legal Actions Demo
- Paths and Path Cost
- Heuristic Functions
- Connected States
- Computing Connectivity Demo
- Computing Connectivity Code
- Connectivity Check
- Connectivity for Bigger Object Sizes
- Speed Optimizations
- Connected Sector Optimization
- Legal Action Optimization
- isLegalAction Optimization
- Legal Action Optimization ++
- Closed List Optimization
- Open List Optimization
- Assignment GUI Demo
- Assignment Code Explained
- Step By Step Code Instructions
- Due Date Notes
Taught by
Dave Churchill
