Choosing Directions in a Maze Generator
Separating legal moves from random choice with a direction mask, a repeat policy, and explicit backtracking state.
Browse the archive
Separating legal moves from random choice with a direction mask, a repeat policy, and explicit backtracking state.
Following a mixed-direction label through source mapping, grapheme fallback, shaping, wrapping, CPU glyph pages, and asynchronous replacement of complete text generations.
How retained release contexts let CPU handles outlive their manager, why object destruction is separate from storage return, and how OpenGL retirement adds a context boundary.
A while loop, an increment-driven for loop and recursion express the same search operations through different control flow.
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…
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…