Abstract
A method is presented for the design of cellular automata rules by means of ant algorithms.
 In particular, Elitist Ant System and a~modified MAX-MIN Ant System are applied to search for transition functions of 1D cellular automata that are able to calculate squares of given input values.
 It will be shown that the proposed MAX-MIN Ant System can perform significantly better than the standard variant of Elitist Ant System.
 In particular, in the most advanced case study, the ant algorithm showed an ability to design a~complete set of elementary cellular automata rules that fulfil the required square calculations.
 Some selected results will be presented and their features discussed.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
