{EPITECH} | Second year | Functionnal Programming
The goal of this project is to implement Wolfram’s elementary cellular automaton in the terminal.
https://en.wikipedia.org/wiki/Elementary_cellular_automaton
You only have to implement rule 30, rule 90 and rule 110. The other rules are considered a bonus.
The space your cellular automaton are living in is infinite (to the left, right, and bottom). This means the parts not shown on screen can still have an effect on future generations. You have to handle the handling of the arguments yourself. Getopt is forbidden.
See the subject for further details !
========================
Grade : A | Mark : 16.5
| Category | Percentage | Tests | Crash ? |
|---|---|---|---|
| Basics | 100% | 1/1 | x |
| Rule 30 | 100% | 3/3 | x |
| Rule 90 | 100% | 3/3 | x |
| Rule 110 | 100% | 3/3 | x |
| Infinite | 100% | 1/1 | x |
| Window and move | 50% | 1/2 | x |
| Performance | 33% | 1/3 | x |
| Error handling | 100% | 5/5 | x |
| Coding Style | 100% | 4/4 | x |
| End score | 88% | 22/25 | No |
Made with Quentin TREHEUX (LuciferBahamut)
Beware of -42 Epitech students !!!