01
Stop at the right time
Optimal stopping says the perfect search can be worse than a timed search. Explore roughly the first 37%, then choose the next option that clears your best benchmark.
Keep this book for later
Sign in to save
Brian Christian and Tom Griffiths
Algorithms
to Live By
A field guide for translating computer science into human judgment: when to stop searching, when to explore, when to sort, and when to accept that the best answer is good enough.
Decision Specimen
Human Runtime
Life is full of hard calls because time, attention, memory, and certainty are finite.
37%
Explore first
Sample before you commit
N log N
Sort only when it pays
Organization has a cost
LRU
Cache what recurs
Memory favors the recently useful
SAT
Satisfice under pressure
Good enough can be optimal
Bug
Searching forever feels responsible
Patch
Choose the stopping rule first
The Premise
Computer science is not just about machines. It is a vocabulary for tradeoffs.
Algorithms to Live By treats everyday life as a series of computational problems. Finding an apartment, deciding when to settle down, organizing a desk, planning a day, and leaving options open all carry hidden costs.
The relief of the book is not that life becomes mechanical. It is that some anxiety is just a missing rule. Once you know the shape of the problem, you can stop pretending unlimited search, perfect certainty, or total order are free.
02
Explore before exploiting
Early information has compound value. Later, repetition has value. The art is knowing when curiosity should give way to commitment.
03
Make computation kind
Sorting, scheduling, and memory all have costs. A messy desk, a short queue, or a good-enough answer may be smarter than perfect control.
Interactive Desk
Convert a messy choice into an algorithmic memo.
Pick a life problem, then tune the horizon, uncertainty, switching cost, and current option quality. The desk turns the book's core algorithms into a practical stopping rule.
Explore budget
14
Acceptance bar
74
Selected algorithm
Optimal stopping
Decision context
Algorithmic memo
Sample first, then commit.
Use the first 37% of the search to set a benchmark, then take the next candidate that beats it.
Explore
Threshold
Pressure
Desk note
Treat the early search as data, not failure to decide.
Framework Anatomy
Five algorithms hiding in plain sight.
The book's world is less about coding and more about choosing the right amount of effort for the problem in front of you.
01
Optimal stopping
Search has a price. Benchmark first, then commit when a strong option appears.
02
Explore/exploit
Novelty is valuable early. Later, harvest what already works.
03
Sorting
Order matters when retrieval repeats. Otherwise, sorting can be wasted theater.
04
Caching
Keep the recently useful close. Forgetting can be an efficiency feature.
05
Scheduling
Do the short urgent job first when queues are painful; protect deep work when context switching is expensive.
Reader Marginalia
Community Insights
"The right time to stop searching is usually earlier than your anxiety wants and later than your impatience wants."
"Explore when information is still changing your model. Exploit when novelty is only delaying courage."
"Memory works better when it keeps the recently useful close and lets stale things drift away."
"Overfitting happens in life whenever you design a rule around yesterday's noise."
Practice File
Action Steps
01
Write a Stopping Rule First
Before your next search, define sample size, minimum bar, and when you will stop comparing — before seeing more options.
I'll do this
02
Run One Explore Batch
Gather a small batch of new signals in an uncertain area, then decide what changed — explore with a budget.
I'll do this
03
Stop Sorting Low-Value Clutter
Choose one area where organization became procrastination. Sort only weekly-used items; leave the rest in a catch-all.
I'll do this
06
Audit Your Queue
List today's tasks by duration and switching cost. Batch similars, clear shorts, protect one long block.
I'll do this
08
Make one good-enough call
Decide one reversible choice at the good-enough threshold. Satisficing beats endless optimizing.
I'll do this
04
Build a Personal Cache
Move the tools, notes, people, and decisions you reuse most into the easiest access layer.
I'll do this
07
Use the stopping rule
When searching, stop at the rule you wrote — do not keep comparing past the sample.
I'll do this
05
Lower the Proof Burden for Reversible Choices
Mark a decision reversible or irreversible. If reversible, set a good-enough threshold and choose faster.
I'll do this
Closing Note
"A good algorithm does not make life mechanical. It gives judgment a sharper edge and anxiety a smaller job."
HourLife distillation
Back to LibraryPrintable plan
Build your mini action book.
Pick setup actions and daily habits from Algorithms to Live By, choose a start date, and download a printable checklist with real calendar pages. Nothing is stored.
Build Mini Action BookQuestions
Frequently asked
What is Algorithms to Live By about?
A computer-science lens on human decisions: when to stop searching, when to explore, how to sort, and why good enough is often optimal.
What are the key takeaways from Algorithms to Live By?
Readers on HourLife most often highlight ideas such as: “The right time to stop searching is usually earlier than your anxiety wants and later than your impatience wants.” “Explore when information is still changing your model. Exploit when novelty is only delaying courage.” “Sorting is not free. Sometimes a little mess is the price of moving quickly.”
Who should read Algorithms to Live By?
It's a strong pick for readers exploring Decision Making and Digital Literacy. HourLife distills its core idea into community-voted insights and one practical action worth trying.
What's one thing I can do after reading Algorithms to Live By?
Write a Stopping Rule First — Before your next search, define sample size, minimum bar, and when you will stop comparing — before seeing more options.
How long does it take to read the Algorithms to Live By summary?
About five minutes. The HourLife summary distills Algorithms to Live By into its core idea, 8 community insights, and 8 practical actions you can apply right away.
More from the author
Follow the source.
Browse every HourLife page connected to the writer behind Algorithms to Live By.
Take it with you
Downloads & shareables.
Print it, pin it, post it. Ways to take Algorithms to Live By off the screen and into the world.
Summary · 8 min read
Read the Text Summary
The core idea, key takeaways, and how to apply Algorithms to Live By as a clean, readable page.
Read summary → Checklist · PDFAction Checklist
Every action from this page as a printable to-do list with a 7-day tracker.
Download PDF →
Card · 1200x630
Book Summary Card
Shareable card with the book and its top-voted insight. Good for saving or social posts.
From reading to doing
Turn this book into a daily practice.
Save the insights that land, build the habits that stick, and keep what you learn from Algorithms to Live By working long after you close the page — inside HourLife.
Also from HourLife
All products →
