TAG
#path-puzzle
0 篇评论 · 2 篇随笔
相关随笔
The Seven Bridges of Königsberg (1736) — The Year Euler Erased the Map to Solve a Sunday Puzzle
The answer is simple. In 1736, the mathematician Leonhard Euler proved that no walk existed that crossed all seven bridges of the Prussian town of Königsberg exactly once and returned to its start. The town's four landmasses were connected by 5, 3, 3, and 3 bridges respectively — all odd numbers. His paper, "Solutio problematis ad geometriam situs pertinentis," was presented on August 26, 1735, and published in 1741. By reducing landmasses to points and bridges to lines, Euler founded what became graph theory — the same logic taught in schools today as the rule for "one-stroke" drawing puzzles. This article traces how that 290-year-old proof still shapes the design of today's routing puzzle games, from Cosmic Express to Lyne to Mini Metro.
数字连线（1897）——从报纸解谜专栏，到 Flow Free 与 Zip 的时代
1897年，解谜作家 Sam Loyd 在《布鲁克林每日鹰报》刊登了《困惑的邻居们》。1917年，Henry Ernest Dudeney 在自己的著作中将其打磨成一款驾车者谜题；1980年代，Nikoli 将其引入日本，命名为 Arukone 与 Numberlink（数字连线）。2012年，Big Duck Games 的《Flow Free》把它变成彩色圆点与管道，下载量突破一亿；到2025年，这一脉系谱延伸至领英（LinkedIn）的每日谜题《Zip》。本文追溯这条已有120余年历史的规则——不交叉地画出一条线——是如何存活至今的。
