When the Shortest Path Fails: Brachistochrone Detours, Second-Order Consequence Mapping and Holographic Deep Thinking: chapter answers
Three popular sayings treat the shortest path as the best one: a straight line is the fastest route between two points; choosing the best step every time adds up to the best result; and thinking too much is procrastination, so ship first. This book refutes or bounds each in turn. In a gravitational field the quickest route is the cycloid, not the line: in the square case the cycloid needs only 0.9128 of the line's time. This is the strict result of Bernoulli's challenge of 1696; every business analogy in the book is structural only and states when it breaks. After checking the sources the boo…
DOI pending · monograph page goes live after publication · 5DL-B-384 · 中文版
- Chapter 1 · The Brachistochrone: Why the Straight Line Loses to the Cycloid
In a gravitational field the quickest route is the cycloid, not the straight line. Program p11 finds that in the square case the cycloid takes 0.9128 of the line's time, and the advantage grows with horizontal distance.… - Chapter 2 · Roundabout Preparation: the Break-even of Building the Road First
Chapter 2 turns building the road first into a schedule model: with illustrative parameters the best preparation takes 20.6% of the schedule, saves 39.2% and breaks even at 59.94. - Chapter 3 · The Limits of Greed: Inside and Outside the Matroid
Chapter 3 sets greed against dynamic programming on matroids and beyond; in the knapsack trap greed obtains 0.0002 of the optimum. - Chapter 4 · One More Road and Everyone Is Slower: Braess's Paradox and Selfish Routing
Chapter 4 computes Braess's paradox, in which a free shortcut raises the equilibrium time from 65.00 to 80.00 minutes, and shows it appears only in a band of demand. - Chapter 5 · The Second-Order Interest on First-Order Shortcuts: Hidden Rework Liability
Chapter 5 writes the second-order rework of a first-order shortcut as a liability with an implied interest rate ranging from -51.5% to +26.8%; in a year-long simulation the careful lane spends 6.4% of its hours on rewor… - Chapter 6 · The Optimal Depth of Deliberation: Consequence Trees, Evidence For and Against, and Tail Stress
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. - Chapter 7 · Classical Sources: the Sunzi on Manoeuvring, the Twenty-Second Chapter of the Laozi, and Bernoulli's Challenge
With L/H at 1.0 the line takes 0.6386 seconds and the cycloid 0.5829 seconds, so the traveller on the cycloid can leave 0.0557 seconds later, 8.7% of the line's time. The further away the target, the later one can leave… - Chapter 8 · Closing the Loop: the Holographic Decision Ledger, Field Tools and Checker Specifications
Chapter 8 gives the holographic decision ledger, the distilled Detour Break-even and Second-Order Rework Liability Calculator, checker specifications for the four kits and a pre-registered test whose primary comparison…
Illustrative model calculation, not a live quote