Explore grid algorithms for video game AI in this comprehensive lecture. Dive into connected sectors, connectivity, breadth-first search (BFS), and their properties. Learn about reversible actions, closed lists, and market mark techniques. Discover the connectivity algorithm and its applications. Delve into vector fields, magnetic fields, and their implementation in games. Understand the concepts of vector maps, distance maps, and their combination. Gain insights on performance considerations for distance mapping. Explore influence maps and their role in game AI. This lecture is part of the COMP4303 Video Game AI course at Memorial University, taught by Professor David Churchill.
Overview
Syllabus
Introduction
Connected Sector
Connectivity
BFS
Properties
Reversible Actions
Closed List
Market Mark
Connectivity Algorithm
Vector Fields
Magnetic Fields
Vector Field
Vector Maps
Distance Maps
Distance Maps Vector Fields
Performance Notes
Distance Map
Influence Maps
Outro
Taught by
Dave Churchill
Related Courses
-
Introduction to Artificial Intelligence - Assignment 2 Overview - Lecture 7
-
Pathfinding and Steering in Game Programming - Lecture 15
-
Game Programming: Pathfinding and Steering - Lecture 15
-
Introduction to Artificial Intelligence: A* Search Algorithm and Optimizations - Lecture 6
-
Grid Representations in Video Game AI - Lecture 5
-
Video Game AI - Tron AI Tournament - Lecture 19
