Introduction to Artificial Intelligence - Assignment 2 Overview - Lecture 7

Explore a comprehensive lecture on artificial intelligence focusing on Assignment 2 topics. Delve into environment and action costs, legal actions, diagonal and cardinal action relationships, paths, and heuristic functions. Learn about connected states, computing connectivity, and various optimization techniques including connected sector checking, legal action relationships, and precomputation. Discover the intricacies of closed list grids, open list binary heaps, and BFS queue simulation. Examine tie-breaking F values and bidirectional search, including its optimality. Gain insights into the assignment code, particularly Search_Student.js, and understand the marking scheme. This lecture, part of the COMP6980 Intro to Artificial Intelligence course at Memorial University, provides essential knowledge for tackling Assignment 2 and deepening your understanding of AI problem-solving techniques.

- Intro
- A2 Demo
- Powerpoint Start
- New in Assignment 2
- Environment and Action Costs
- Legal Actions
- Diagonal / Cardinal Action Relationship
- Paths
- Heuristic Functions
- Connected States
- Computing Connectivity
- Connectivity Check / canFit
- Connected Sector Sizes
- Optimization: Connected Sector Checking
- Optimization: Legal Action Relationship
- Optimization: Legal Action Precomputation
- Optimization: Closed List Grid
- Optimization: Open List BinaryHeap
- Optimization: BFS Queue Simulation
- Tie-Breaking F Values
- Bidirectional Search
- Assignment Code
- Search_Student.js
- Bidirectional Search Optimality
- Marking Scheme