Ball, W. W. Rouse (Walter William Rouse), 1850-1925 · London, Macmillan · leaf 208
ame of a puzzle which can bethreaded in this way. Assuming that the path forks asdescribed above, the more numerous the nodes and the highertheir order the more difficult will be the maze, and thedifficulty might be increased considerably by using bridges andtunnels so as to construct a labyrinth… … in my own garden on a plot of ground which would not allowof more than 36 by 23 paths, but it will be noticed that noneof the nodes are of a high order. 188 UNICURSAL PROBLEMS [CH. VIII Geometrical Trees. Eulers original investigations wereconfined to a closed network. In the problem of the maze…
Geometry · Cryptography · Ciphers
Internet Archive · Wellesley College Library · Public Domain Mark 1.0. Free to use for anything.
