In Search of the Runner
Translation details
Model:mistral-medium-2604.Translated text
Section titled “Translated text”Based on a map, scouts are positioned at various points in the terrain, each several hundred paces apart. The location of each is unknown to the others. One stands, for example, at a road junction, another at a bridge, a third in a ravine, at the edge of a forest, under a solitary tree, etc. Each has a number that they must memorize.
One scout remains with the patrol leader, who is then sent to Scout No. 1. He is given instructions on where to find him, as well as written orders for all the positioned runners. The messenger delivers these orders to Scout No. 1. This scout reads the order intended for him and, based on it, searches for No. 2 and hands him the remaining orders. No. 2 searches for No. 3, and so on, with the last scout searching for the patrol leader. The question is: at what time will the last scout arrive? From the map, one can calculate the distance and judge whether the entire exercise was completed in good or poor time. (The orders are brief, e.g., direction NNE, distance 300 paces, halfway up the eastern slope of the forest, distance 300 paces). Scouts should be positioned so that they form a closed polygon, as returning when arranged in a line takes a lot of time. The patrol leader stands either in the middle or forms one of the polygon’s corners.
If two patrols are to compete, outposts are formed with two scouts each (white and red), and two messengers are sent in opposite directions with orders to the nearest outposts. These orders are indeed different. The patrol that completes the task in the shortest time wins.
Source scan: Polona / National Library of Poland, marked “Public domain”. View scan — PDF pages 65–66.
Metadata
Section titled “Metadata”- Type: game
- Traits: Not stated in the source
- Source: Zygmunt Wyrobek, Harcerz w polu: zabawy i gry terenowe (1946)
- Printed pages: 59–60 / PDF 65–66
- Digital edition: Digital edition · Source record
- Open the edition at the relevant page: p. 59
- Read the source text: hwp-006