Om Mangalam

Tower of Brahma

Legend of Kashi Vishwanath: priests move 64 golden discs on three diamond needles. One move per second → 264−1 moves (~584.9 billion years) until the cosmos renews.

End date (when finished) — Updates with discs, seconds/move, and start time
Total moves—
Current move—
Elapsed—
Remaining—

Visual stack shows up to 16 discs for clarity; metrics always use full N (BigInt). Pegs: Brahma (A), Vishnu (B), Shiva (C).

What if the end of the universe is just… finishing a puzzle?

Imagine standing in the hush of Kashi Vishwanath. Three diamond needles. Sixty-four golden discs. A rule so simple a child can learn it — yet so vast that finishing the puzzle outlasts stars. One move per second. No shortcuts. When the last disc settles, the story says, the cosmos begins again.

Here is the quiet shock: mathematics agrees that 264 − 1 is not a poetic number — it is an exact count. Scrub the timeline. Change N. Watch the end date leap with your settings. Ask yourself: did ancient storytellers encode exponential time long before computers needed BigInt?

In computer science, this is the famous Tower of Hanoi problem — the same three pegs, the same “never place a larger disc on a smaller one” rule, and the same recursive structure that CS students meet early on. Optimal play takes exactly 2N − 1 moves. That single formula teaches modern lessons: recursion and divide-and-conquer, state-space explosion, why “just one more disc” can double the work, and why exponential algorithms break calendars long before they break patience. Gray-code and binary tricks even let you jump to any move without replaying every step — the same efficiency mindset behind good software. Legend and lab share one puzzle; this canvas lets both speak.