Skip to main content
Log in

Domino pattern formation by cellular automata agents

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Considered is a 2d cellular automaton with moving agents in a multi-agent system. The objective is to find agents controlled by a finite-state program (FSP) that can form domino patterns. The quality of a formed pattern is measured by the degree of order computed by counting matching \(3 \times 3\) templates. An agent reacts on its own color, the color in front and whether it is blocked or not. It can change the color, move or not and turn into any direction. Four FSPs were evolved with k agents (\(1 \le k \le 4\)) initially placed in the corners of the field. For a \(12 \times 12\) training field, the aimed pattern could be formed with a 100% degree of order. The performance was also high with other field sizes. Livelocks are avoided by using three different variants of the evolved FSP. The degree of order usually fluctuates after reaching a certain threshold, but it can also be stable, and the agents may show the termination by running in a cycle or by stopping their activity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. Respectively denoted as “soft” and “hard”’ termination in [21]. The termination problem is examined elsewhere [22].

  2. The total computation time on a Intel Xeon QuadCore 2 GHz was around 4 weeks to find all needed FSP.

References

  1. Shi D, He P, Lian J, Chaud X, Bud’ko SL, Beaugnon E, Wang LM, Ewing RC, Tournier R (2005) Magnetic alignment of carbon nanofibers in polymer composites and anisotropy of mechanical properties. J Appl Phys 97:064312

    Article  Google Scholar 

  2. Itoh M, Takahira M, Yatagai T (1998) Spatial arrangement of small particles by imaging laser trapping system. Opt Rev 5(1):55–58

    Article  Google Scholar 

  3. Jiang Y, Narushima T, Okamoto H (2010) Nonlinear optical effects in trapping nanoparticles with femtosecond pulses. Nat Phys 6:1005–1009

    Article  Google Scholar 

  4. Niss M (2005) History of the Lenz–Ising model, 1920–1950. From ferromagnetic to cooperative phenomena. Arch Hist Exact Sci 59(3):267–318

    Article  MathSciNet  Google Scholar 

  5. Press D, Ladd TD, Zhang B, Yamamoto Y (2008) Complete quantum control of a single quantum dot spin using ultrafast optical pulses. Nature 456:218–221

    Article  Google Scholar 

  6. Bagnold RE (1941) The physics of blown sand and desert dunes. Chapman and Hall, Methuen

    Google Scholar 

  7. Turing AM (1952) The chemical basis of morphogenesis. Philos Trans R Soc Lond B 237:37–72

    Article  MathSciNet  Google Scholar 

  8. Tyson JJ (1976) The Belousov–Zhabotinskii reaction. Lecture Notes in Biomathematics

  9. Greenberg JM, Hastings SP (1978) Spatial patterns for discrete models of diffusion in excitable media. SIAM J Appl Math 34(3):515–523

    Article  MathSciNet  Google Scholar 

  10. Progogine I, Stengers I (1983) Order out of chaos. Heinemann, London

    Google Scholar 

  11. Chopard B, Droz M (1998) Cellular automata modeling of physical systems. Cambridge University Press, Cambridge

    Book  Google Scholar 

  12. Deutsch A, Dormann S (2005) Cellular automaton modeling of biological pattern formation. Birkäuser, Basel

    MATH  Google Scholar 

  13. Désérable D, Dupont P, Hellou M, Kamali-Bernard S (2011) Cellular automata in complex matter. Complex Syst 20(1):67–91

    Article  MathSciNet  Google Scholar 

  14. Wolfram S (1983) Statistical mechanics of cellular automata. Rev Mod Phys 55(3):601–644

    Article  MathSciNet  Google Scholar 

  15. Nagpal R (2008) Programmable pattern-formation and scale-independence. In: Minai AA, Bar-Yam Y (eds) Unifying themes in complex systems IV, pp 275–282

  16. Yamins D, Nagpal R (2008) Automated global-to-local programming in 1-D spatial multi-agent systems. In: Proceedings of the 7th International Conference AAMAS, pp 615–622

  17. Hoffmann R (2014) How agents can form a specific pattern. In: Wa̧s J, Sirakoulis G, Bandini S (eds) Cellular automata, LNCS, vol 8751, pp 660–669

    Google Scholar 

  18. Hoffmann R (2016) Cellular automata agents form path patterns effectively. Acta Phys Pol B Proc Suppl 9(1):63–75

    Article  Google Scholar 

  19. Hoffmann R, Désérable D (2016) Line patterns formed by cellular automata agents. In: El Yacoubi S, Wa̧s J, Bandini S (eds) Cellular automata, LNCS, vol 9863, pp 424–434

    Google Scholar 

  20. Birgin EG, Lobato RD, Morabito R (2010) An effective recursive partitioning approach for the packing of identical rectangles in a rectangle. J Oper Res Soc 61:303–320

    Article  Google Scholar 

  21. Hoffmann R, Désérable D (2017) Generating maximal domino patterns by cellular automata agents. In: Malyshkin V (ed) PaCT 2017, LNCS, vol 10421, pp 18–31

    Google Scholar 

  22. Hoffmann R, Désérable D, Seredyński F (2018) Stability levels and termination in evolved CA agents for the black-pattern task. In: Cellular automata, ACRI 2018. http://wikicfp.com/cfp/servlet/event.showcfp?eventid=72598&copyownerid=106289

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dominique Désérable.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hoffmann, R., Désérable, D. Domino pattern formation by cellular automata agents. J Supercomput 75, 7799–7813 (2019). https://doi.org/10.1007/s11227-018-2429-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-018-2429-z

Keywords

Navigation