The designed Naive Algorithm applying cellular automata theory

Abstract

This research studies my newly designed Naive Algorithm working in the context of cellular automata. In this way, we are able to solve complex problems through simple evolution without using any deep learning techniques; its realization was just done by natural selection. Therefore, the deduction of finding the optimal strategy became simple and traceable. During the experiment, thanks to the convenience of Python and MongoDB database, where my data can be written into different categories of collections. We will record all the states of samples after each move so that we can see their state changes more intuitively and clearly, and help subsequent analysis.