Lazy Peregrin

Context and definition

The Lazy Peregrin is a named route-finding problem posed in terms of a traveling avout (cloistered scholar-monk) who must visit several enclosures of the Math (walled scholarly enclave). The task is to determine the shortest path that reaches all listed destinations. In this context “Peregrin” refers to Peregrin (sanctioned travel outside maths).

Speakers describe it as the kind of problem that tempts one to enumerate all possible routes, which is impractical when many destinations are involved. The name “lazy” is used but not explained in the discussion.

Significance and usage

The problem is invoked as a standard example when explaining devices attributed to Saunt Grod that are said to evaluate many candidate routes “at once” by configuring a generalized model of the map and then reading out a single result. This is presented as an illustration of how a certain class of machines-or by analogy, minds-might sift through vast possibility spaces without explicitly listing every option.

Notes

• The informal statement does not specify further constraints (e.g., starting or ending point, whether revisits are allowed); only the aim of finding the shortest route that reaches all destinations is stated.
• The use of “Peregrin” here is thematic: a traveler on sanctioned journeys between maths; it does not imply any particular rite or authorization beyond the framing of the puzzle.