What does Detours and the Depth of Thinking conclude, in numbers, about “The Optimal Depth of Deliberation: Consequence Trees, Evidence For and Against, and Tail Stress”?
Answer: Chapter 6 builds consequence trees and finds the optimal depth of deliberation; leaving out opposing evidence makes a judgement of 0.643 look like 0.900.
Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. This is not investment advice or advice on any particular business decision, and it promises no return.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.643, 0.900
A. Evidence ledger (prior odds 1:1) pro only sum log10 LR +0.9542 P(detour better) 0.900 pro + con sum log10 LR +0.2553 P(detour better) 0.643 pro + con + synthesis sum log10 LR +0.3345 P(detour better) 0.684 B. Tail stress, 50,000 draws each option mean q05 q01 ES05 shortcut 8.54 -34.06 -56.42 -48.75 detour 8.38 3.36 -20.30 -6.92
Show the full program
# Chapter 6. p63: thesis, antithesis, synthesis - then the tail
# Part A: evidence for "the detour beats the shortcut" is logged as
# likelihood ratios (LR > 1 supports, LR < 1 opposes). Log10 LRs add
# (math.fsum); posterior odds = prior odds x 10^total. We show what
# dropping the opposing column does to the verdict. LRs illustrative.
# Part B: tail stress. Option payoffs (hours-equivalent) are mixtures:
# normal case with prob 1 - t, tail case with prob t. 50,000 fixed-seed
# draws; we report the mean, the 5% and 1% quantiles and the mean of
# the worst 5% (expected shortfall). Illustrative parameters.
import math
import random
PRO = [("pilot ran 18% faster", 2.0), ("tooling reused twice", 1.5),
("rework fell in 3 of 4 trials", 3.0)]
CON = [("one trial slower", 0.5), ("learning curve not counted", 0.4)]
SYN = [("gain holds only for long jobs", 1.2)]
def post(items, prior=1.0):
tot = math.fsum(math.log10(lr) for _, lr in items)
odds = prior * 10 ** tot
return tot, odds / (1 + odds)
print("A. Evidence ledger (prior odds 1:1)")
for label, items in (("pro only", PRO), ("pro + con", PRO + CON),
("pro + con + synthesis", PRO + CON + SYN)):
tot, p = post(items)
print(" {:<22} sum log10 LR {:+.4f} P(detour better) {:.3f}"
.format(label, tot, p))
rng = random.Random(38463)
OPTS = {"shortcut": (12.0, 4.0, 0.06, -45.0, 12.0),
"detour": (9.0, 3.0, 0.02, -20.0, 6.0)}
print("B. Tail stress, 50,000 draws each")
print(" option mean q05 q01 ES05")
for name, (mu, sd, t, tmu, tsd) in OPTS.items():
xs = sorted(rng.gauss(tmu, tsd) if rng.random() < t
else rng.gauss(mu, sd) for _ in range(50000))
n5 = len(xs) // 20
print(" {:<8} {:6.2f} {:6.2f} {:6.2f} {:6.2f}".format(
name, math.fsum(xs) / len(xs), xs[n5], xs[len(xs) // 100],
math.fsum(xs[:n5]) / n5))Single source and citation
Fan, Y. (2026). When the Shortest Path Fails: Brachistochrone Detours, Second-Order Consequence Mapping and Holographic Deep Thinking (Version 1.0.0), Chapter 6: The Optimal Depth of Deliberation: Consequence Trees, Evidence For and Against, and Tail Stress. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-384 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026384,
author = {Fan, Yafu},
title = {When the Shortest Path Fails: Brachistochrone Detours, Second-Order Consequence Mapping and Holographic Deep Thinking},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Brachistochrone: Why the Straight Line Loses to the Cycloid
- Chapter 2 · Roundabout Preparation: the Break-even of Building the Road First
- Chapter 3 · The Limits of Greed: Inside and Outside the Matroid
- Chapter 4 · One More Road and Everyone Is Slower: Braess's Paradox and Selfish Routing
- Chapter 5 · The Second-Order Interest on First-Order Shortcuts: Hidden Rework Liability
- Chapter 7 · Classical Sources: the Sunzi on Manoeuvring, the Twenty-Second Chapter of the Laozi, and Bernoulli's Challenge
- Chapter 8 · Closing the Loop: the Holographic Decision Ledger, Field Tools and Checker Specifications