In this part of our series, we'll introduce a new mechanic to the character: ledge grabbing. We'll also make appropriate changes to both the pathfinding...

In this tutorial, we'll use the platformer pathfinding algorithm we've been building to power a bot that can follow the path by itself; just click on a...

In this tutorial, we'll extend our grid-based platformer pathfinder so that it can cope with characters that take up more than one cell of the grid.

In this short tutorial, we'll extend our platformer pathfinder so that it can deal with one-way platforms: blocks that the character can jump through and...

Now that we have a good idea of how to modify an A* pathfinding algorithm to work for platformers, it's time to actually code it. Rather than build it from...

In this tutorial, I'll explain a broad overview of how to modify a standard A* pathfinding algorithm to work for platformers by taking into account the way...

Making good artificial intelligence for computer opponents is difficult, but it's often difficult for the wrong reasons. What makes an AI fun, and should we...

In this part of the series, we'll add the missing pieces required to turn the hockey prototype into an actual, playable game. These include a score,...

In this tutorial, we finish coding our hockey game artificial intelligence using steering behaviors and finite state machines. This time, we implement the AI...

In this tutorial, we continue coding artificial intelligence for a hockey game using steering behaviors and finite state machines. In this part of the...

If you're going to make an action, sports, or strategy game with many units controlled by the computer, you will need some serious artificial intelligence....

A finite-state machine is a model used to represent and control execution flow. It is perfect for implementing AI in games, producing great results without a...