A=B

A=B is a programming puzzle game in the Zachlike tradition with a single, brutally minimal instruction: A=B. The rule is exactly what it says — replace every occurrence of A in the string with B, then move on. Multiply two binary numbers using only string substitutions. Convert lowercase to uppercase. Implement Brainfuck-style logic. Every solution is a sequence of replacement rules, and that's the whole language.

The restriction is the puzzle. Some problems sit in obvious reach; others demand you discover non-obvious encodings of state within the string itself, because A=B has no variables, no conditionals as you'd normally write them, no loops in the traditional sense. The community has spent years finding clever solutions to problems that look easier than they turn out to be.

The game also rewards line-count optimization — shortest programs unlock recognition on internal leaderboards — and a built-in minigame functions as the Zachlike tradition's required side activity. The whole project leans on a single elegant constraint and explores how far it can be pushed.