13. 1-D CA in Excel
Dan Ryan » Computational Thinking » Exercises » 13. 1-D CA in Excel
13. 1-D CA in Excel
Implement a one dimensional cellular automata in Excel
1dCA-1.png1dCA-2.png1dCA-3.png1dCA-4.png
  1. spreadsheet = rows/columns of cells
  2. cells contain values or formulas
  3. formula as right hand side of a statement of the form location = expression
  4. conditional formatting (1=dark, 0=light)
  5. changing column width, row height
  6. a cell range is denoted by upperLeftROWCOL:lowerRightROWCOL
  7. start with a random sequence of eight 1s and 0s in cells M1:T1, “the seed”
  8. we will fill in the next row (L2:U2); each cell based on its three “parents”
  9. fill in B2:D8 with 000 to 111; these are all the possible parent patterns
  10. in cells E2:E8, again, a random sequence of 1s or 0s
  11. the information in A2:E8 is “the rules”
  12. focus on L2; it’s parents are K1:M1; find the pattern in the rules and fill in L2 (treat blanks as zero)
  13. repeat for M2:U2
  14. but this is tedious; in A2:A8 type 0,…7 to number the rules
  15. compute rule number for each cell we want to color in row three
  16. ruleNumber = leftParent*4+centerParent*2+rightParent
  17. autofill row three cells
  18. VLOOKUP(ruleNumber, ruleRange, returnValueInColumn)
  19. autofill row three cells
  20. auto fill next row
  21. try changing the rules
  22. try changing the seed

27 Jun 2018 01:28

In class for CT Session:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
homework for CT Session:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
See extra for CT Session:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |


Not in class for CT week:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Not homework for CT week:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Not extra for CT week:
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
ct