当前位置: X-MOL 学术J. Supercomput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A cellular automata rule placing a maximal number of dominoes in the square and diamond
The Journal of Supercomputing ( IF 2.5 ) Pub Date : 2021-02-02 , DOI: 10.1007/s11227-020-03549-8
Rolf Hoffmann , Dominique Désérable , Franciszek Seredyński

The objective is to demonstrate that a probabilistic cellular automata rule can place reliably a maximal number of dominoes in different active area shapes, exemplarily evaluated for the square and diamond. The basic rule forms domino patterns, but the number of dominoes is not necessarily maximal and the patterns are not always stable. It works with templates derived from domino tiles. The first proposed enhancement (Rule Option 1) can form always stable patterns. The second enhancement (Rule Option 2) can maximize the number of dominoes, but the reached patterns are not always stable. All rules drive the evolution by specific noise injection.



中文翻译:

元胞自动机规则在正方形和菱形中放置最大数量的多米诺骨牌

目的是证明概率细胞自动机规则可以可靠地将最大数量的多米诺骨牌放置在不同的活动区域形状中,示例性地针对正方形和菱形进行了评估。基本规则形成多米诺骨牌图案,但是多米诺骨牌的数量并不一定是最大的,并且这些图案并不总是稳定的。它适用于从多米诺骨牌拼贴派生的模板。首先提出的增强功能(规则选项1)可以形成始终稳定的模式。第二个增强(规则选项2)可以最大化多米诺骨牌的数量,但是所达到的模式并不总是稳定的。所有规则都通过特定的噪声注入来推动演进。

更新日期:2021-02-02
down
wechat
bug