Heyo, just as a quick announcement, I’ve added a new page to the site dedicated to Pathfinding. My hope is to grow it into an entire section of the site, with detailed information about pathfinding algorithms, breakdowns and summaries of academic research papers, and links to other helpful sites with more information and demos, but for now it’s a giant braindump of information.

Of particular note is the table of papers at the end of the page. While not comprehensive, it does cover a number of major papers that have influenced the field and produced commonly-used algorithms. I’ve added some quick notes for each paper, as well as links to where you can view them without needing a journal subscription (one of the few things I miss about being a student; journal subs are expensive).

This page is a hub for information about pathfinding of all types. The focus here is primarily on grid-based pathfinding, but I’ll be collecting information on all pathfinding topics as I encounter them.

Note: The topic here is pathfinding algorithms for computers. If you’re looking for information about wilderness pathfinding, your princess is in another castle. I’d recommend starting here and expanding your search from there.

You’ll find me using the terms “search” and “pathfinding” interchangably here. That’s because pathfinding is just a type of searching; you’re exploring some sort of search space to find a way to get from your starting point to a goal point, and that way is literally just a path through the search space.