Tag Archives: Java

The Basics of A* Pathfinding – part 1

The A* algorithm allows you to find the shortest path between two points with (impassable) obstacles between them. The key word here is “shortest”. Let’s take a look at what that means: How A* “sees” it Imagine we have the … Continue reading

Posted in Examples, Game Dev | Tagged , , , , , , , , , , , | 12 Comments

The Basics of Game Loop Implementation – part 1

Intro Games at their core have what’s called a “game loop”‘: a looping construct which advances the game a little bit at a time. The main issue with the game loop is how to make it so that it “paces” … Continue reading

Posted in Examples, Game Dev | Tagged , , , , , , , | 7 Comments