2026-06-29 12:33:34
Just wrote a fun little algorithm for iterating through all grid positions within X euclidean distance from a center, roughly in order of distance but also mostly ensuring each position yielded is at least diagonally adjacent to the previous. It's a fun problem to think about with lots of design tradeoffs and many valid solutions.
My solution requires that the origin be on the grid (I think?) and uses a bunch of caching instead of a bajillion distance checks, although I don't actually know what the memory/speed tradeoff is like or whether there are any gains at all (could be net losses, which I'm starting to wonder about more as I write this post). Thankfully I don't expect performance to be very critical here anyways, and doing the caching actually helped separate some logic in a useful way.
A fun little diversion from bigger stuff in the project and a reminder of some of the joys of programming design at a small scope. Feels kinda like mastering the local town's minigame while you're stuck on the main quest in an RPG.
#programming
















![A screenshot of a tweet from Mappers [@]CarolMaps, dated Jan 12, featuring the text "IMPORTANT". The main image is a photograph of an open book page being held by a thumb, containing various printed instructions.
A red hand-drawn circle surrounds the sentence: "You may fascinate a woman by showing her your git branches." A green arrow points from this circled text toward a dark graphical element labeled "GRAPH" containing orange and blue interconnected nodes.](https://cdn.woof.tech/media_attachments/files/117/114/040/488/548/439/small/97c419c9352f7b22.jpg)

