Using Sequences of Knots as a Random Search
Fink and Mao define a knot as “a sequence of moves creating an aesthetic structure or topology, where its properties are preserved under continuous deformations” . Thus, it is possible to emulate a random search behavior , using a set of steps that represents a knot. However, a single knot is not enough to cover a specific area, due to this lack of coverage, we suggest link several knots in order to increase the searching scope.
- 2.Livingston, C.: Knot theory. The Mathematical Association of America (1993)Google Scholar
- 4.Wilensky, U.: Netlogo, center for connected learning and computer-based modeling (1999), http://ccl.northwestern.edu/netlogo
- 5.Berg, H.C.: Random walks in biology. Princeton University Press, Princeton (1993)Google Scholar