关于「原典考辨:《孙子·军争》《老子》第二十二章与伯努利征题」,《非最短路径与推演深度》给出的定量结论是什么?
结论:L/H 为 1.0 时,直线要 0.6386 秒,摆线要 0.5829 秒,走摆线的人可以晚出发 0.0557 秒,占直线用时的 8.7%。目标越远,可以晚出发得越多:L/H 为 2.0 时可晚 0.2041 秒,占 20.2%;L/H 为 3.0 时可晚 0.4095 秒,占 28.7%。目标较近时,余地很小:L/H 为 0.5 时只能晚 0.0141 秒,占 2.8%。
数据口径:书中参数为示意,全部计算由书中程序生成。 本书不是投资意见,也不是任何具体经营决策意见,不承诺任何收益。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.0141, 0.0557, 0.2041, 0.4095, 0.5, 0.5829
| A. Cycloid may leave later by (seconds, share of line time) | |
| L/H | 0.5: line 0.5048 s, cycloid 0.4907 s, head start 0.0141 s (2.8%) |
| L/H | 1.0: line 0.6386 s, cycloid 0.5829 s, head start 0.0557 s (8.7%) |
| L/H | 2.0: line 1.0096 s, cycloid 0.8056 s, head start 0.2041 s (20.2%) |
| L/H | 3.0: line 1.4278 s, cycloid 1.0183 s, head start 0.4095 s (28.7%) |
| B. Tooling plan: direct 100.00, detour 60.80; the detour may | |
| start 39.20 units later and still finish first | |
| C. Gain of the curve as the target moves under the start | |
| L/H | 0.01: cycloid/line time 1.0000 |
| L/H | 0.05: cycloid/line time 0.9997 |
| L/H | 0.10: cycloid/line time 0.9988 |
| L/H | 0.25: cycloid/line time 0.9924 |
查看完整验算程序
# Chapter 7. p71: "set out later, arrive first" as a measurable margin
# Sunzi's line on the roundabout march is turned into one number: how
# much later a traveller on the curved path may leave and still arrive
# no later than one on the straight path. Part A uses the frictionless
# cycloid against the line (g = 9.81, closed forms). Part B uses the
# tooling model of chapter 2 (W = 100, a = 1.5, tau = 10). Part C asks
# where the curve stops paying: as L/H -> 0 the target is straight
# below and the straight drop is itself the fastest path.
# Illustrative geometry and parameters.
import math
G = 9.81
def cyc_time(L, H):
lo, hi = 1e-12, 2 * math.pi - 1e-9
for _ in range(200):
mid = 0.5 * (lo + hi)
if (mid - math.sin(mid)) / (1 - math.cos(mid)) > L / H:
hi = mid
else:
lo = mid
th = 0.5 * (lo + hi)
r = H / (1 - math.cos(th))
return th * math.sqrt(r / G)
def line_time(L, H):
return math.sqrt(2 * (L * L + H * H) / (G * H))
print("A. Cycloid may leave later by (seconds, share of line time)")
for L in (0.5, 1.0, 2.0, 3.0):
tl, tc = line_time(L, 1.0), cyc_time(L, 1.0)
print(" L/H = {:3.1f}: line {:.4f} s, cycloid {:.4f} s, head start"
" {:.4f} s ({:.1%})".format(L, tl, tc, tl - tc, 1 - tc / tl))
W, A, TAU = 100.0, 1.5, 10.0
def total(d):
return d + W / (1 + A * (1 - math.exp(-d / TAU)))
lo, hi = 0.0, W
gr = (math.sqrt(5) - 1) / 2
for _ in range(200):
x, y = hi - gr * (hi - lo), lo + gr * (hi - lo)
if total(x) < total(y):
hi = y
else:
lo = x
ts = total(0.5 * (lo + hi))
print("B. Tooling plan: direct {:.2f}, detour {:.2f}; the detour may"
.format(W, ts))
print(" start {:.2f} units later and still finish first".format(W - ts))
print("C. Gain of the curve as the target moves under the start")
for L in (0.01, 0.05, 0.1, 0.25):
print(" L/H = {:4.2f}: cycloid/line time {:.4f}".format(
L, cyc_time(L, 1.0) / line_time(L, 1.0)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《非最短路径最优解、二阶连锁效应全息推演与周密思考复利母典》第 7 章「原典考辨:《孙子·军争》《老子》第二十二章与伯努利征题」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}