Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very pow- erful framework that supports both co-routining and parallelism. In this work we show that David H. D. Warren's design for the EAM with Im- plicit Control does not perform well for deterministic computations and we present several optimisations that allow the BEAM to achieve perfor- mance matching or even exceeding related systems. Our optimisations rene the original EAM control rule demonstrate that overheads can be reduced through combined execution rules, and show that a good design and emulator implementation is relevant, even for a complex system such as the BEAM.