This thesis deals with an evolutionary solving of the Rubik's cube. The worldwide known puzzle has been for several decades not only a toy for children and adults, but also almost a lifestyle for crowds of fans and definitely a big challenge in the world of computation, where scientists seek to find an effective automated solution. The potential for its solution could also be borne by evolutionary algorithms. The author of this thesis has developed an application employing, apart from genetic algorithms, also many advanced technics, such as linear genetic programming or local search. The goal of this special technics is to make the evolutionary process more effective. There have also been made tests of the crossover, the population size and the mutation probability influence. All the tests have been statistically evaluated.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:237031 |
| Date | January 2011 |
| Creators | Mališ, Radim |
| Contributors | Sekanina, Lukáš, Jaroš, Jiří |
| Publisher | Vysoké učení technické v Brně. Fakulta informačních technologií |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0018 seconds