Graph Algorithms for AI in Games

Simpliv

Course

Online

£ 150 + VAT

The best Other programming courses

See all

See all

Description

  • Type

    Course

  • Methodology

    Online

  • Start date

    Different dates available

Understand Graph Algorithms to create your own game in AIGraphs arise in various real-world situations as there are road networks, computer networks and, most recently, social networks! If you're looking for the fastest time to get to work, cheapest way to connect a set of computers into a network you will need algorithms on graphs.For using the efficient algorithm to automatically find communities and opinion leaders on Facebook, you're going to work with graphs and algorithms on graphs. This course will serve as an introduction to graphs and present their increasingly complex algorithms that work on graphs. In the course, you will start by understanding how graphs can be used in games to represent various states and how searching graphs can help us. The course will introduce you to pathfinding, which is one of the most commonly solved problems in game AI. The course will then show you how to Optimize the pathfinding. Finally, at the end of the course, you will learn the concept of meta-heuristics which can be used to find general solutions in complex domains.About the AuthorDaniel Jallov loves developing games with a flair for artificial intelligence and procedural content generation. He wrote a Master’s Thesis on how to procedurally generate artificial intelligence and how to build a game where the uncertainties of procedurally generated AI are used to engage the users rather than scare them away.
He is by no means a competitive gamer, but he enjoys games as a way to relax, to get challenged and to be entertained. I love the cinematic feel of modern AAA games, and he loves the intense game play experience of Super Hexagon and Hotline Miami. He loves getting lost in a deep story, and grinding for loot in a deep cave. He loves isolating himself in another world and playing local multiplayer’s with friends.

Facilities

Location

Start date

Online

Start date

Different dates availableEnrolment now open

About this course

Make graphs to represent your game state
Use the breadth first search on your regular graphs
Implement the depth - first search with your usual graphs
Use pathfinding in your grid and mazes
Work with optimizing the Heuristics in your game
Implement A* Search for a more balanced Heuristics
Create your very own Pac Mac like Game

Questions & Answers

Add your question

Our advisors and other users will be able to reply to you

Who would you like to address this question to?

Fill in your details to get a reply

We will only publish your name and question

Reviews

This centre's achievements

2021

All courses are up to date

The average rating is higher than 3.7

More than 50 reviews in the last 12 months

This centre has featured on Emagister for 4 years

Subjects

  • Algorithms
  • Works
  • Networks
  • Artificial Intelligence
  • Information Systems
  • Information Systems management
  • Programming
  • Programme Planning
  • Design
  • Graphics

Course programme

Understanding Graphs 5 lectures 29:22 The Course Overview This video provides an overview of the course. What Are Graphs? What is a graph and what properties does a graph have.
  • Define the graph
  • Edge weights
  • Directed edges and cycles
Implementing Graphs When implementing graphs, we have to choose how to represent the graph.
  • Choose between adjacency lists or an adjacency matrix
  • Implement the graph
  • Test the implementation
Implementing Trees What is a tree and how can we implement one?
  • See that a tree is actually a graph
  • Implement trees with adjacency lists
  • A tree can be contained in a single class
How Can We Use Graphs in Games? What problems can we solve with graphs when creating games?
  • Graphs can represent game worlds for navigation
  • Graphs can represent progress in games
  • Graphs can represent moves in board games
Understanding Graphs 5 lectures 29:22 The Course Overview This video provides an overview of the course. What Are Graphs? What is a graph and what properties does a graph have.
  • Define the graph
  • Edge weights
  • Directed edges and cycles
Implementing Graphs When implementing graphs, we have to choose how to represent the graph.
  • Choose between adjacency lists or an adjacency matrix
  • Implement the graph
  • Test the implementation
Implementing Trees What is a tree and how can we implement one?
  • See that a tree is actually a graph
  • Implement trees with adjacency lists
  • A tree can be contained in a single class
How Can We Use Graphs in Games? What problems can we solve with graphs when creating games?
  • Graphs can represent game worlds for navigation
  • Graphs can represent progress in games
  • Graphs can represent moves in board games
The Course Overview This video provides an overview of the course. The Course Overview This video provides an overview of the course. The Course Overview This video provides an overview of the course. The Course Overview This video provides an overview of the course. This video provides an overview of the course. This video provides an overview of the course. What Are Graphs? What is a graph and what properties does a graph have.
  • Define the graph
  • Edge weights
  • Directed edges and cycles
What Are Graphs? What is a graph and what properties does a graph have.
  • Define the graph
  • Edge weights
  • Directed edges and cycles
What Are Graphs? What is a graph and what properties does a graph have.
  • Define the graph
  • Edge weights
  • Directed edges and cycles
What Are Graphs? What is a graph and what properties does a graph have.
  • Define the graph
  • Edge weights
  • Directed edges and cycles
What is a graph and what properties does a graph have.
  • Define the graph
  • Edge weights
  • Directed edges and cycles
What is a graph and what properties does a graph have.
  • Define the graph
  • Edge weights
  • Directed edges and cycles
Implementing Graphs When implementing graphs, we have to choose how to represent the graph.
  • Choose between adjacency lists or an adjacency matrix
  • Implement the graph
  • Test the implementation
Implementing Graphs When implementing graphs, we have to choose how to represent the graph.
  • Choose between adjacency lists or an adjacency matrix
  • Implement the graph
  • Test the implementation
Implementing Graphs When implementing graphs, we have to choose how to represent the graph.
  • Choose between adjacency lists or an adjacency matrix
  • Implement the graph
  • Test the implementation
Implementing Graphs When implementing graphs, we have to choose how to represent the graph.
  • Choose between adjacency lists or an adjacency matrix
  • Implement the graph
  • Test the implementation
When implementing graphs, we have to choose how to represent the graph.
  • Choose between adjacency lists or an adjacency matrix
  • Implement the graph
  • Test the implementation
When implementing graphs, we have to choose how to represent the graph.
  • Choose between adjacency lists or an adjacency matrix
  • Implement the graph
  • Test the implementation
Implementing Trees What is a tree and how can we implement one?
  • See that a tree is actually a graph
  • Implement trees with adjacency lists
  • A tree can be contained in a single class
Implementing Trees What is a tree and how can we implement one?
  • See that a tree is actually a graph
  • Implement trees with adjacency lists
  • A tree can be contained in a single class
Implementing Trees What is a tree and how can we implement one?
  • See that a tree is actually a graph
  • Implement trees with adjacency lists
  • A tree can be contained in a single class
Implementing Trees What is a tree and how can we implement one?
  • See that a tree is actually a graph
  • Implement trees with adjacency lists
  • A tree can be contained in a single class
What is a tree and how can we implement one?
  • See that a tree is actually a graph
  • Implement trees with adjacency lists
  • A tree can be contained in a single class
What is a tree and how can we implement one?
  • See that a tree is actually a graph
  • Implement trees with adjacency lists
  • A tree can be contained in a single class
How Can We Use Graphs in Games? What problems can we solve with graphs when creating games?
  • Graphs can represent game worlds for navigation
  • Graphs can represent progress in games
  • Graphs can represent moves in board games
How Can We Use Graphs in Games? What problems can we solve with graphs when creating games?
  • Graphs can represent game worlds for navigation
  • Graphs can represent progress in games
  • Graphs can represent moves in board games
How Can We Use Graphs in Games? What problems can we solve with graphs when creating games?
  • Graphs can represent game worlds for navigation
  • Graphs can represent progress in games
  • Graphs can represent moves in board games
How Can We Use Graphs in Games? What problems can we solve with graphs when creating games?
  • Graphs can represent game worlds for navigation
  • Graphs can represent progress in games
  • Graphs can represent moves in board games
What problems can we solve with graphs when creating games?
  • Graphs can represent game worlds for navigation
  • Graphs can represent progress in games
  • Graphs can represent moves in board games
What problems can we solve with graphs when creating games?
  • Graphs can represent game worlds for navigation
  • Graphs can represent progress in games
  • Graphs can represent moves in board games
Searching in Graphs 6 lectures 38:47 What Are We Searching for? What does it mean to search, and what can we find by searching?
  • Define searching
  • Figure out what we are looking for
  • Use the results of the search
Using Breadth-First Search (BFS) Learn the theory behind BFS and see how it works.
  • Define BFS algorithm
  • See how it works
  • Define a stopping condition
Implementing BFS on Regular Graphs Implement BFS on regular graphs.
  • Implement BFS
  • Add a stopping condition
  • Examine the results of the search
Using Depth-First Search (DFS) Learn the theory behind DFS and see how it works.
  • Define DFS algorithm
  • See how it works
  • Compare DFS with BFS
Implementing DFS Implement DFS on regular graphs.
  • Implement DFS
  • Examine the results of the search
  • Compare DFS results with BFS results
Example - A Simple Puzzle Game Solve the sliding puzzle by representing the puzzle states as a graph and use BFS and DFS to search for the solution.
  • Define the rules of the puzzle
  • Modify BFS and DFS to suit the puzzle
  • Compare the results of solving with BFS and DFS
Searching in Graphs. 6 lectures 38:47 What Are We Searching for? What does it mean to search, and what can we find by searching?
  • Define searching
  • Figure out what we are looking for
  • Use the results of the search
Using Breadth-First Search (BFS) Learn the theory behind BFS and see how it works.
  • Define BFS algorithm
  • See how it works
  • Define a stopping condition
Implementing BFS on Regular Graphs Implement BFS on regular graphs.
  • Implement BFS
  • Add a stopping condition
  • Examine the results of the search
Using Depth-First Search (DFS) Learn the theory behind DFS and see how it works.
  • Define DFS algorithm
  • See how it works
  • Compare DFS with BFS
Implementing DFS Implement DFS on regular graphs.
  • Implement DFS
  • Examine the results of the search
  • Compare DFS results with BFS results
Example - A Simple Puzzle Game Solve the sliding puzzle by representing the puzzle states as a graph and use BFS and DFS to search for the solution.
  • Define the rules of the puzzle
  • Modify BFS and DFS to suit the puzzle
  • Compare the results of solving with BFS and DFS
What Are We Searching for? What does it mean to search, and what can we find by searching?
  • Define searching
  • Figure out what we are looking for
  • Use the results of the search
What Are We Searching for? What does it mean to search, and what can we find by searching?
  • Define searching
  • Figure out what we are looking for
  • Use the results of the search
What Are We Searching for? What does it mean to search, and what can we find by searching?
  • Define searching
  • Figure out what we are looking for
  • Use the results of the search
What Are We Searching for? What does it mean to search, and what can we find by searching?
  • Define searching
  • Figure out what we are looking for
  • Use the results of the search
What does it mean to search, and what can we find by searching?
  • Define searching
  • Figure out what we are looking for
  • Use the results of the search
What does it mean to search, and what can we find by searching?
  • Define searching
  • Figure out what we are looking for
  • Use the results of the search
Using Breadth-First Search (BFS) Learn the theory behind BFS and see how it works.
  • Define BFS algorithm
  • See how it works
  • Define a stopping condition
Using Breadth-First Search (BFS) Learn the theory behind BFS and see how it works.
  • Define BFS algorithm
  • See how it works
  • Define a stopping condition
Using Breadth-First Search (BFS) Learn the theory behind BFS and see how it works.
  • Define BFS algorithm
  • See how it works
  • Define a stopping condition
Using Breadth-First Search (BFS) Learn the theory behind BFS and see how it works.
  • Define BFS algorithm
  • See how it works
  • Define a stopping condition
Learn the theory behind BFS and see how it works.
  • Define BFS algorithm
  • See how it works
  • Define a stopping condition
Learn the theory behind BFS and see how it works.
  • Define BFS algorithm
  • See how it works
  • Define a stopping condition
Implementing BFS on Regular Graphs Implement BFS on regular graphs.
  • Implement BFS
  • Add a stopping condition
  • Examine the results of the search
Implementing BFS on Regular Graphs Implement BFS on regular graphs.
  • Implement BFS
  • Add a stopping condition
  • Examine the results of the search
Implementing BFS on Regular Graphs Implement BFS on regular graphs.
  • Implement BFS
  • Add a stopping condition
  • Examine the results of the search
Implementing BFS on Regular Graphs Implement BFS on regular graphs.
  • Implement BFS
  • Add a stopping condition
  • Examine the results of the search
Implement BFS on regular graphs.
  • Implement BFS
  • Add a stopping condition
  • Examine the results of the search
Implement BFS on regular graphs.
  • Implement BFS
  • Add a stopping condition
  • Examine the results of the search
Using Depth-First Search (DFS) Learn the theory behind DFS and see how it works strong We implement Dijkstra's algorithm on graphs.
  • Implement Dijkstra's...

Additional information

Having some knowledge of programming languages and algorithms

See related categories

Graph Algorithms for AI in Games

£ 150 + VAT

The best Other programming courses

See all

See all