This is a universal gate which is reversible. It has three boolean inputs and 3 boolean outputs.
The mol file is fredkin.mol, which can be found in the gh-pages/dynamic branch of the repo.
In this demo the outputs are big circles coloured with green, purple and red and the interesting inputs are boolean terms, as translated from lambda calculus to chemlambda, with the termination nodes coloured with green and red. It is interesting to see how the small green and red circles arrive near the big green and red ones and how generally the Fredkin gate is destroyed after it achieves the goal.
