The Course Overview
What Are Graphs?
How Can We Use Graphs in Games?
What Are We Searching for?
Using Breadth-First Search (BFS)
Implementing BFS on Regular Graphs
Using Depth-First Search (DFS)
Example - A Simple Puzzle Game
What Is a Shortest Path?
Implementing Pathfinding in General Graphs
Representing Grids and Mazes as Graphs
Implementing Pathfinding in Grids
What Is a Heuristic?
Greedy Heuristic - Best First Search
Finding a More Balanced Heuristic - A* Search
Implementing A* Search
Search-Space Optimization - Bi-directional Search
Defining the Game Logic and AI
Implementing "random" Movement for Ghosts
Implementing pathfinding with a Lag
Using Dijkstra's Algorithm for Fleeing Ghosts
The Final Game
There are currently no items in your shopping cart.