Duck Pond State Machine

this is a work in progress

Flowgraphs can be used to construct a wide variety of pipelines and loops in a wide variety of topologies nested to arbitrary depth. One useful construct is to use a loop to implement the state of a state machine. In this example, the state is a pond that can hold ducks and the state transition is a decision by the duck to fly to the next pond or stay in this pond.

In the simplest case there are two ponds with a capacity for one duck, and only one duck deciding each time around the pond's loop whether to stay in this pond or fly to the other one.