Browse the archive
Games aren’t particularly renowned for their spot-on physics simulations. In fact, they often take quite a few liberties with reality. But therein lies a curious charm—a world where the laws of nature bend to the whims of entertainment. In this article, we dive into the realm…
A Gumbo-query fork reorganizes public headers and CMake configuration, with a successful native build, one direct fixture check, and inherited integration gaps kept explicit.
A small RegexRenamer extension adds recursive file collection and full-path matching, while exposing unfinished depth and path-validation behavior.
A while loop, an increment-driven for loop and recursion express the same search operations through different control flow.
Using a small experiment to inspect unfamiliar C++ behavior, illustrated by stream redirection and the limits of compiler-generated names.
Normally a tile map displays spaces which can be defined in finite terms using a piece of paper. A hypermaze, however, can be defined using a piece of paper, only, if you use a graph to describe how the pieces fit together. This is true for…
Number distributions are excessively useful to random number generators. Procedural generation tends to revolve around random numbers, ergo number distributions are immensely useful in procedurally generating data. With distributions you can easily give some spice to your random number rolls. Give a hero a damage range…
If you have a project you're working on which has memory constraints, you'll probably consider data compression to some degree or another at some point in development. Memory constraints are usually due to limitations of hardware on your target system/architecture; for reasons, you're probably looking at…
There you are designing a parallel algorithm, and then it occurs to you: How do I return information to the main thread from a child thread? If you've skimmed through half of The C++ Programming Language (4th Edition) by Bjarne Stroustrup like I have, you may…
A recursive pathfinding algorithm finds a path by growing & backtracking a path. You can’t evaluate multiple routes, you only have the one, and you explore it til you reach a dead end or the goal. So, how pray tell does one optimize a recursive pathfinding…
