The Escalator That Says No

There are four Python keywords living in my old house.

Not metaphorically. Actually living there — at specific spots, tied to specific memories that get stranger every time I try to explain them. One keyword lives at the laundry room door. Another floats above a tiny bench at the front entrance. A third sits at a round plastic table with a blood-written NO button the size of a small cat. The fourth is an indoor escalator running at ten miles per hour, humming “no no no no no.”

I am a locomotive engineer, 36 years old, working through CS50P on rotating shifts. Memory palaces — encoding information to physical locations with bizarre sensory imagery — are one of the tools I picked up from memory-sport training. The brain is terrible at holding abstract information and excellent at remembering places and disturbing events. If I need to remember that elif fires only when the prior condition was false, a blood-soaked NO button beats a Notion note every time.

The images are entirely my invention — that’s the rule. The Generation Effect says you encode information better when you produce the image yourself, not when someone describes it to you. What this means in practice is that I sit down to encode “elif means the next question only if the prior was no” and my brain produces: a cat-sized button soaked in blood, the smell of copper, letters scrambling out and writing NO on the floor. Memory-sport training is a commitment.

Today was the first session where the encoding produced something unplanned.

The four terms — Conditionals, if, elif, else — map to four spots through the front entrance of the house. When I encoded Conditionals at the laundry door, I gave it a mechanism: YES takes you back into the laundry room, NO teleports you to the bench. The bench is where if lives. elif is at the round table, the next spot down the hall. else is the stairs — now an escalator, humming its verdict.

The palace walk mirrors Python’s control flow without me planning it that way. Conditionals asks the question. If YES, if fires and you’re done. If NO, you’re at the bench. If if doesn’t fire, you land at the table. If that also fails, the escalator catches everything that made it that far.

The thing that clicked: spatial adjacency is one recall hook. Causal narrative is two. The walk works not because those loci are next to each other, but because each one is the mechanical consequence of the prior. The NO answer doesn’t just point to the next locus — it is the reason you end up there.

Build the Why Into the Chain, Not Just the Where

A standard palace walk sequences loci by proximity. The trick from today is to encode the transition itself — not just “I go to the bench next” but “the NO answer is what sends me to the bench.” When the mechanism of connection lives inside the image, you recall both the destination and the reason.

This generalizes beyond memory work. Think of elif like a single-elimination tournament. Once you lose, you’re done — no more games. Once one condition returns true in Python, every remaining elif and else is skipped entirely. Three independent if statements are three parallel tournaments running at once: a score of 95 prints A, then B, then C, then D, because all four conditions pass independently. Three elif statements are one tournament: first true result ends the match. The escalator only gets the people who lost every round.

The session ended when I tried to start PSet 0 in the CS50 Codespace and got stuck because I forgot to run mkdir indoor before creating the file. Two commands. Next session.

Eight out of ten. The escalator says no to everything.