search function, in terms of the "legal moves" (moves allowed by the chosen policy and defined by the created network), is performed in each consecutive node (or a state) that has been occupied, and after which a decision regarding the node to occupy next is made, enabling search and decision-making iterations to continue
Me, several years ago: "I'll never try digital 3D art... just have no interest to learn it. Already have learned other art forms that I barely use anyway... so why add to that ?..."
Me, currently: [Is attempting to model a donut in Blender]
"... uh... I can explain..."
"Python Turtle is a program or perhaps the better term is a Python library inspired by LOGO. It is an old programming educational language created in 1967 by Daniel Bobrow (1935-2017), Wally Feurzig (1927-2013) and Seymour Papert (1928-2016) at the Bolt, Beranek and Newman research firm in Cambridge, Massachusetts. Many derivations of LOGO have been introduced in the past five and half decades with improvements and more powerful user interfaces but one thing has remained in common: The turtle commands are simple, intuitive and it makes fun to program with them."
Omar Silva-Zapata
Post #2: Thinking about LOGO and the roots of turtle programming, Omar Silva-Zapata, Introduction to programming with Python Turtle, Kindle Edition, 89 pages, 2023.
proximity analysis: display of possible (legal) moves in a network (along the connection lines/edges to the subsequent point (state)) given the location (with regards to the selected network point)
location - dynamic variable/parameter
number of closest points to be analysed and displayed - fixed value (video 1)