This section republishes the classic maze-solving algorithms of Wiener (1873), Trémaux (1882) and Tarry (1895). The chapter from König’s book (1936) provides a critical discussion of these.
Euler’s famous paper on the Königsberg bridges (1736) and Tarry’s paper on the number of Eulerian circuits (1886) are also included, as they are closely connected with the subject.
To avoid difficulties with copyright, the English translations on this website are by MB.
Other English translations are available for some items.
Note (March 2012): Opera may not always display mathematical subscripts correctly. No errors were noticed with other browsers tested (Chrome, Firefox, IE8, Safari).