A Short and Direct Walk with Pascal’s Triangle

How pathfinding algorithms can be improved by counting paths

Classic pathfinding algorithms like Dijkstra’s Algorithm and A* are used to generate travel routes in applications such as video games, mobile robotics, and architectural design. Despite the popularity of these algorithms, the paths they produce rarely go straight. In this article, you’ll learn how to compute highly direct paths using a counting technique inspired by Pascal’s …

artificial intelligence game-development pascal pathfinding robotics thoughts-and-theory