2d:null 2e:["$","title",null,{"children":"SM2220 Assignment 7 | ychsu6 | Observable"}] 33:T7ed,md` ## Reading Response ### [Game of Life - Emergence in Generative](https://www.artnome.com/news/2020/7/12/the-game-of-life-emergence-in-generative-art) Jason Bailey - It seems that it is all about separated simple rules explaining complex global behaviors in a reduced way, and the simplest “either 0 or 1” choices merely make all individuals identical and obey the same rules; however, when two or more different properties come together to perform something larger or seem to be intelligent in ways, the exciting outcomes are something that can't be predicted from merely looking at the original rules but require us to run through the algorithms ourselves. - It’s not only the process of breaking down abstract common features and making them more accessible to analyze or experiment but with such massive parallel local interactions further perform complex adaptive systems, that in return feedback into a certain level of determination of local interactions (in some cases). - Or, moreover, in some other cases, neither complete order nor complete disorder performs the most “surprising result”, but rather only when it’s within a certain level of “chaos” and “order” can the most interesting “complexity” be introduced. - Besides, it’s an interesting point of view to think about that it is the “human algorithm” that is interpreting complex behaviors derived from simple pixels actions. [The transmission, storage, and modification of information](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.227.1164&rep=rep1&type=pdf) in this case, imply the movement, evolution, and time, then together suggest the concept of ”life”, or how we interpret it as "life". - But no matter whether it is just about how we interpret the pixels system behaviors in our own context, it does provide useful perspectives and tools that go beyond the boundaries of natural science (biology, physical), social studies, and art, thus strengthening the connection between the system and nature.
`34:T653,md` ### Optional: [Social Dynamics: 2D Cellular Automata](https://www.jasss.org/1/3/1.html) - The 2D Cellular Automata with multiple possible intervals suggests that the more possible opinions there are, the closer the stable results get to universal consensus and the smoother the transitions are between areas of differing opinion. The graph shows that the closer we get to the continuous opinion case, the more the stable end configuration is centered in the middle of the opinion space. - It's indeed a very interesting outcome, and very much like how the social processes. We assumed that the more different opinions exist, the harder it is for an opinion system to reach a consensus; however, it is in fact the opposite: the more general opinions distribute among the two extremes, the more likely each of them seemed to be "canceled out" by each other.
- The other study is about the dynamics of segregation and suspicion, suggesting that "a negative attitude towards the other group combined with indifference towards one's own group may lead to much more massive clusters than under positive feelings for one's own group". - Neutral opinion toward oneself in combined with negative attitudes toward the others surprisingly form an even more segregated group in results than under positive feelings for one's own group. - It seems like a stronger drive toward one's own kind actually encourage individuals to settle down easier, while the combination with only negative forces tends to give up on forming groups with closer neighbors, but go all the way to the extreme. `35:[{"id":"7bed77639f17c1403da1843b9d81b2b263e27cc9dd74f65d0693154d7c9acb0171c650a7efc31f58a9d1288958da70ca8ee53ee20e9687842cf7a632d22d2091","href":"https://static.observableusercontent.com/files/7bed77639f17c1403da1843b9d81b2b263e27cc9dd74f65d0693154d7c9acb0171c650a7efc31f58a9d1288958da70ca8ee53ee20e9687842cf7a632d22d2091","name":"Screenshot 2021-10-27 at 12.57.13 PM.png","type":"image/png","lastModified":1635310659403.494,"size":263034}] 31:{"id":"c7805d1554eb08fa","slug":"sm2220-assignment-7","title":"SM2220 Assignment 7","thumbnail":"3ee19924c350a366021cbc5d48b5876f23e90d26bc3cd214da78e700d2364bf2","access_level":"public","create_time":"$D2021-10-26T14:52:01.647Z","update_time":"$D2022-09-29T08:25:37.153Z","view_time":null,"first_public_time":"$D2021-10-26T14:53:34.350Z","has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"c3d91d7db2867b4d","login":"betahsu","name":"ychsu6","avatar_url":"https://avatars-next.observableusercontent.com/197b7792c36f626b9fe391a472486b8b6dc3cf3503a2bb52e365e7916c324a9e","tier":"starter_2024"},"version":104,"publish_version":104,"role":null,"authored":false,"authors":[{"type":"individual","id":"8205ffe96d046f8c","login":"betahsu","name":"ychsu6","avatar_url":"https://avatars-next.observableusercontent.com/197b7792c36f626b9fe391a472486b8b6dc3cf3503a2bb52e365e7916c324a9e","tier":null}],"members":[{"type":"individual","id":"8205ffe96d046f8c","login":"betahsu","name":"ychsu6","avatar_url":"https://avatars-next.observableusercontent.com/197b7792c36f626b9fe391a472486b8b6dc3cf3503a2bb52e365e7916c324a9e","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":true,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"title":"SM2220 Assignment 7","cells":[{"id":0,"value":"# SM2220 Assignment 7","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":10,"value":"$33","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":44,"value":"$34","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":56,"value":"md`\n## Create\n### Algorithm1: Basic Game of Life\n\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":17,"value":"md`\n### Algorithm2: 2D Cyclic Cellular Automata\nCyclic Cellular Automata were first developed by David Griffeath at the University of Wisconson.\nHere are the rules:\n1. Take a 2D grid of cells.\n2. Select a maximum number of states each cell can have and a threshold value.\n4. Fill the cells with random state values between 0 and (maximum states-1).\n5. At each step of the simulation every cell follows these rules;\na) Count how many neighboring cells ([Moore](http://en.wikipedia.org/wiki/Moore_neighborhood) or [Von Neumann neighborhoods](http://en.wikipedia.org/wiki/Von_Neumann_neighborhood)) surround the cell with a value of the current cell’s state + 1\nb) If the count is greater or equal to the threshold value then the cell state is incremented by 1\n6. Repeat this process as long as you want to.
\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":31,"value":"md``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":20,"value":"md`\n### Further Iteration\nI was trying to look for methods that, when I further iterate from the original Cellular Automata, the CA algorithm still exists for a reason (as I realized [my previous creative work on Game of life](https://preview.p5js.org/BetaHsu/present/Lx6dzM_eN) makes the original algorithm hardly noticeable). Therefore, it should be somewhere between \"breaking the grid boundary\" and \"preserving the interactions between neighbors while updating the cell status\"... \n\nAnd I found it extremely difficult, especially due to the feature in such algorithms that \"Time is discrete\" in the system...\n#### Creation 1\nInspired by The “Q-toothpick” CA\n\n\n#### Creation 2\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":85,"value":"md`\nSome technical issues are not solved yet, but I think is closer to how I think is: \"breaking the grid boundary\" and \"preserving the interactions between neighbors while updating the cell status\", where the interaction process can be visualized while breaking the original \"grids form\".\nWhat it's supposed to be like: a second grids containing 3*3 of the original grids, while the lines show the 5 stages of Cyclic Cellular Automata:\n\n

\n
(not done yet...)\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W35","stdlib":"1","titling":"auto"}} 32:"$31:body"