Leonardo Kasperavičius

In the previous posts I’ve talked about the problem of find a path and about the Dijkstra Algorithm. Even finding always the shortest path between two points (if a possible path exists, of course), the Dijkstra algorithm has some caveats when used in games. At first, let’s talk [...]

(Read More)

In 1959, Edsger Wybe Dijkstra created an algorithm known as “Shortest-Path Algorithm”,  which was and still is the basis for the creation of several other specific and improved algorithms. The Shortest-Path algorithm does not use the real position of the points to compute the [...]

(Read More)

One of the most common problems in game programming is the need to find a path to move some intelligent entity. Take as an example a game where the player (a ghost) is pursued by some enemies. A simple solution to this problem could be an algorithm where the direction is obtained from the [...]

(Read More)

For a long time I wanted to create a blog, so I’ve asked my great friend Ney Estrabelli and he created this blog for me. I will publish some interesting things related to Game Programming, Art and Kung-Fu, the three things I love to do. Keep reading leocck.com ! [...]

(Read More)