Introduction Imagine 3,000 zombies swarming toward the player. If you compute an individual path for each zombie? A single A* search traverses hundreds to thousands of nodes, and you’d have to rep...

Introduction In 2018, Aras Pranckevičius published remarkable results from the ToyPathTracer benchmark. C# Burst was faster than C++ in some cases — on PC, Burst 140 Mray/s vs C++ 136 Mray/s. ...

Introduction In the previous post, we analyzed the architectural design principles of Claude Code. In this post, we go one level deeper to dissect Harness Engineering — the design principles behin...

Introduction Claude Code is a CLI-based AI coding agent developed by Anthropic. It’s an agentic tool that directly reads, modifies, builds, and tests code from the terminal, and has evolved rapidl...

Introduction In the previous post, we covered the principles of Unity Job System and Burst Compiler. In Part 4, we explored the cache hierarchy, the basics of AoS vs SoA, and the relationship betw...

Introduction To drive thousands of agents at 60fps in Unity, a single main thread is not enough. Path sampling, separation steering, distance calculations, matrix transforms — all of these must be...

Introduction Multithreaded programming is an unavoidable topic in game development. As CPUs have evolved toward increasing core counts rather than clock speeds, single-threaded programs can no lon...

Introduction The ability of AI agents to learn and remember long-term beyond a single conversation is a central topic of AI research in 2025–2026. Claude Code is one of the most aggressively exper...

Introduction This article is the 6th installment of the CS Roadmap series. In Part 1, we saw the 100x difference between L1 cache (~1ns) and RAM (~100ns). We also saw that cache locality is t...

Introduction This article is the 5th installment of the CS Roadmap series. In Part 4, we saw how trees guarantee O(log n) through hierarchical structure. BSTs search while maintaining order, ...