8.2.7 The Wanderer (Rookie)

The Wanderer (Rookie) is a high-density algorithm operating on a two-dimensional area. It takes the wandering process as a metaphor to optimize the packing of the membrane. The operation differs from the one of the previously discussed random placing algorithms, because it iteratively tries to optimize the placement for each single lipid. There are no additional placement correction and/or annealing processes - it is a greedy algorithm.


The panel shows the options of The Wanderer.


A single wandering step

The figure following shows the typical procedure of a wandering run. In this case, the starting point is a membrane which contains two lipids already placed by The Wanderer.

First, a new lipid is generated and placed. Obviously this new lipid is positioned on top of the previously placed lipid - they are intersecting.

Now the wandering process starts. The new lipid moves east for a free position. Next, it would move south if no free position is found. But because the lipid already found a free position, this method is skipped. 

Now, the lipid should move west to find a fellow. But again, this procedure is not needed in this case, because the lipid is already positioned directly besides the previously placed lipid (because the lipid did not wander south). Therefore, the next method is invoked, causing the lipid searching for a fellow in the north. The lipid stops when meeting the border in the north.

Now the final process is started: the lipid wanders and dances. The rotation process is associated with a movement to the west and north. The latter cardinal direction does not cause a visual difference, because the lipid already touches the northern border. 

The process stops when the new lipid moved very close to the lipid located in the north­western corner of the layer.