Summary: The tasks of navigation and orientation in networks, as well as their information support, are considered. The question is focused on the cost and complexity of the necessary information for movement. For a square network, it is shown that it is sufficient to use the simplest navigation rules to move along it in an optimal way, without preliminary calculating the shortest routes. Which greatly simplifies and reduces the cost of movement. Generalizations of the square network that preserve similar properties are considered. The concepts of azimuthal navigation and azimuthal subnet are introduced. The variants of local information about possible directions of further movement during azimuthal navigation in the network are proposed.