Agent Memory Retrieval: Score-Space Landscape (2D)
2D counterpart to the 3D agent-memory simulator: memories are placed on a unit circle by embedding angle and plotted a second time in a similarity-versus-recency score-space landscape, so the exact retrieval formula and the forgetting/eviction rule are visible as flat, readable geometry instead of a rotating point cloud.
This is the 2D counterpart to the 3D agent-memory simulator, and it uses a genuinely different geometry to show the same mechanism: instead of a 3D embedding sphere seen through an orbiting camera, memories live on a 1-parameter unit circle (an embedding angle) and are drawn twice — once on that raw circle, and once mapped into a similarity-versus-recency score-space where the retrieval formula itself is rendered as a shaded landscape. Reweighting semantic similarity, recency and importance visibly reshapes the landscape and reorders the ranked shortlist in real time, and as the bounded memory store fills up, the lowest-scoring memory against the current query is evicted — the same forgetting rule used by bounded, scored agent-memory systems like MemGPT-style tiered memory and time-weighted vector retrievers.
2D counterpart to the 3D agent-memory simulator: memories are placed on a unit circle by embedding angle and plotted a second time in a similarity-versus-recency score-space landscape, so the exact retrieval formula and the forgetting/eviction rule are visible as flat, readable geometry instead of a rotating point cloud.
2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install