YoVDO

Grid Algorithms in Video Game AI - Lecture 7

Offered By: Dave Churchill via YouTube

Tags

Pathfinding Courses C++ Courses Breadth-First Search Courses Vector Fields Courses SFML Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

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

The Beginner's Guide to Artificial Intelligence (Unity 2022)
Udemy
Build Your Own First Person Shooter / Survival Game in Unity
Udemy
Python Data Structures and Algorithms
LinkedIn Learning
Unity 5: 2D Pathfinding
LinkedIn Learning
New Features in Unity 3.5
Pluralsight