Page 63 - Algorithms Notes for Professionals

Chapter 13: A* Pathfinding Algorithm

This topic is going to focus on the A* Pathfinding algorithm, how it's used, and why it works.

Note to future contributors: I have added an example for A* Pathfinding without any obstacles, on a 4x4 grid. An
example with obstacles is still needed.

Section 13.1: Simple Example of A* Pathfinding: A maze with no
obstacles

Let's say we have the following 4 by 4 grid:

Let's assume that this is a maze. There are no walls/obstacles, though. We only have a starting point (the green
square), and an ending point (the red square). Let's also assume that in order to get from green to red, we cannot

colegiohispanomexicano.net – Algorithms Notes 59