How do the bubbles know the best move?

The bubbles want to organize as unique sets but they are going to leave some bubbles stranded. When we say the best they can do is stable poison surfaces, that is an input.  We find out bounds on the compression ratio:
t = s^3/c^3+(1/2)* s/c^3; with tanh,cosh, and sinh; or a close proximity.

These are bubles left over when a balanced bipartite graph is found. Its a probability distribution, Skellam; and layer in the count of duplicates whihc have conservation of bubble requirements.

So the ratio equation tells s how these buble encode and decode.  The c bubble take a dare step, an s bubble takes the bait, the c bubble sneak in two ore steps, then the s buble take two steps and the mess stops.  So thed tanh differential equation just puts bounds on the allocation of steps, or moves in the game. The Skellam distribution is the distribution  of bipartite graphs, I think, Peters holy  grail.

Its a two gteam game, bosons vs fermions. Fermions move to  contain cold positions,  bosons move  to contain hot positions. That Skellam distribution is the Shannon cost of stable adaption.