Software implementation of asynchronous and synchronous cellular automata with maximum domino tiles coverage

A two-dimensional asynchronous cellular automaton covering the cellular array with a maximum number of domino tiles is considered. For the purpose of parallel implementation, a transition to the synchronous operation mode was made. The paper presents asynchronous and synchronous cellular automata implementations. Their evolution and performance characteristics are analyzed. It is shown that the synchronous automaton creates the desired pattern. In the implementation of the transition rule, matching of multiple templates was optimized by combining the templates into a multi-template and applying a single bitwize matching operation.