![Graph Algorithms for AI in Games [Video]](https://static.packt-cdn.com/products/9781788472180/cover/smaller)
Graph Algorithms for AI in Games [Video]
This course has been retired. Check out the alternatives below
- $12.99 Video + Subscription Buy
-
What do you get with a Packt Subscription?
- Instant access to this title and 7,500+ eBooks & Videos
- Constantly updated with 100+ new titles each month
- Breadth and depth in over 1,000+ technologies
-
Understanding Graphs
- The Course Overview
- What Are Graphs?
- Implementing Graphs
- Implementing Trees
- How Can We Use Graphs in Games?
-
Searching in Graphs
- What Are We Searching for?
- Using Breadth-First Search (BFS)
- Implementing BFS on Regular Graphs
- Using Depth-First Search (DFS)
- Implementing DFS
- Example - A Simple Puzzle Game
-
Working with Pathfinding
- What Is a Shortest Path?
- Dijkstra's Algorithm
- Implementing Pathfinding in General Graphs
- Representing Grids and Mazes as Graphs
- Implementing Pathfinding in Grids
-
Optimization Heuristics
- 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
-
Creating a Pacman-Like Game
- 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
![Data Visualization in Python by Examples [Video]](https://static.packt-cdn.com/products/9781788838658/cover/smaller)
![Data Visualization Projects in Python [Video]](https://static.packt-cdn.com/products/9781788830416/cover/smaller)
![Implementing AI to Play Games [Video]](https://static.packt-cdn.com/products/9781788476539/cover/smaller)