The designed Naive Algorithm applying cellular automata theory

A tétel rövid nézete
dc.contributor.advisorHorváth, Géza
dc.contributor.authorHaoru, Sui
dc.contributor.departmentDE--Informatikai Kar
dc.date.accessioned2023-04-20T07:04:34Z
dc.date.available2023-04-20T07:04:34Z
dc.date.created2023-04-18
dc.description.abstractThis 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.
dc.description.correctorN.I.
dc.description.courseComputer Science
dc.description.degreeBSc/BA
dc.format.extent47
dc.identifier.urihttps://hdl.handle.net/2437/350274
dc.language.isoen
dc.rights.accessHozzáférhető a 2022 decemberi felsőoktatási törvénymódosítás értelmében.
dc.subjectdesigned Algorithm
dc.subjecttraceble AI
dc.subjectautomata theory
dc.subject.dspaceDEENK Témalista::Informatika
dc.titleThe designed Naive Algorithm applying cellular automata theory
Fájlok
Gyűjtemények
Theses (IK)