group to space map and space to group map

initial run t=1 (t=0 is seeding agents)
1. group to space map :: CA-A 1
2. Synthetic Gestalt
3. space to group ie. agents know which edge permeable, which not :: CA-S 1
complete process of new bits (both birth agents and emerging spaces)
t=2, 3, ...n
1. group to space map :: CA-A 2
possible mapping: on top of existing y and on top of existing x
2. Synthetic Gestalt
3. space to group :: CA-S 2
new bits process as follows:
if on top of existing y, then insert new x that shares an edge to the y;
if on top of existing x,
first case (of the single permeable x to y), insert new x shares an edge to the x
second case (two adjoin x that share edges to y), no new x make the shared edge as permeable edge.

each new x means one agent birth, positioned randomly.

death rule: any unsupported mapping, will bring death to the existing space and its corresponding agent.