Answer to Question #8938 in MatLAB | Mathematica | MathCAD | Maple for Julius

Question

Consider a simple polymer, which consists of long chains of simple molecules attached to each other, for example: ..CH[2]-CH[2]-CH[2]-... If the interaction energy between consecutive sections can beignored or is low enough, the chains can be bend around at various places to form various configurations. let us make model of a simple polymer which is restricted to lie within a two-dimensional plane. one can start by fixing the first section to a particular coordinate and then add additional components by use of random walk with the condition that it may not intersect itself. it should be clear that when forming a polymer in this way, it can happen that you end up in a cul-de-sac, i.e. you can not add an additional component to lengthen it further, without intersecting with itself. when this happens the polymer is terminated. a general outline of the algorithm would be as follow: initialize an array that would be keep track of all the positions of the random walker start the random