Flow field pathfinding
You may know me for my interactive tutorials. But before that, I was writing visual but non-interactive tutorials. In particular, there wasn't a lot of information about A* on the web, so I decided to collect all my notes about pathfinding together in one place in the 1990s. But then in the 2010s I started making interactive pages. The newer pages are narrower in scope; I covered a broader set of
Red Blob Games: Making maps with noise
written Jul 2015, then updated in 2016, 2017, 2018, 2019, 2020, and 2022 One of the more popular pages on my site is about polygonal map generation[1]. Making those maps was a lot of work. I didn’t start there. I started with something much simpler, which I’ll describe here. The simpler technique can make maps like this in under 50 lines of code: I’m not going to explain how to draw these maps; th
Implementation of Hex Grids
Note: this article is a companion guide to my guide to hex grids. The data structures and functions here implement the math and algorithms described on that page. The main page covers the theory for hex grid algorithms and math. Now let’s write a library to handle hex grids. The first thing to think about is what the core concepts will be. Since most of the algorithms work with cube coordinates, I
Flow Field Pathfinding for Tower Defense
Feb 2014, updated Aug 2014, Nov 2018, Jul 2020In a Tower Defense game, there are many enemies that are all headed to the same place. In many Tower Defense games, there is a predetermined path, or a small number of paths. In some, such as the classic Desktop Tower Defense[1], you can place towers anywhere, and they act as obstacles that affect the paths taken by enemies. Try it out, and click on th
Making of: Introduction to A*
2 Sep 2014(Warning: these notes are rough – the main page is here and these are some notes I wrote for a few colleagues and then I kept adding to it until it became a longer page) Several people have asked me how I make the diagrams on my tutorials. I need to learn the algorithm and data structures I want to demonstrate. Sometimes I already know them. Sometimes I know nothing about them. It varies
Red Blob Games: Introduction to A*
Created 26 May 2014, updated Aug 2014, Feb 2016, Jun 2016, Jun 2020In games we often want to find paths from one location to another. We’re not only trying to find the shortest distance; we also want to take into account travel time. Move the blob (start point) and cross (end point) to see the shortest path. To find this path we can use a graph search algorithm, which works when the map is represe
Red Blob Games: Hexagonal Grids
Mar 2013, updated in Mar 2015, Apr 2018, Feb 2019, May 2020, Oct 2021 This guide will cover various ways to make hexagonal grids, the relationships between different approaches, and common formulas and algorithms. I've been collecting hex grid resources[1] for over 25 years. I wrote this guide to the most elegant approaches that lead to the simplest code, starting from the guides by Charles Fu[2]
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Grids and Graphs