2,951
edits
Conway's Game of Life: Difference between revisions
Jump to navigation
Jump to search
m
Show the exact code from Scholes' video
m (Navbox and recreation category) |
m (Show the exact code from Scholes' video) |
||
| Line 3: | Line 3: | ||
A famous video by [[John Scholes]]<ref name="scholes">[[John Scholes|Scholes, John]]. [https://www.youtube.com/watch?v=a9xAKttWgP4 "Conway's Game of Life in APL"]. 2009-01-26.</ref> explains the following [[Dyalog APL]] implementation step by step. The implementation takes advantage of [[nested]] arrays and the [[Outer Product]] to produce many copies of the argument array. It finds adjacent elements by [[Rotate|rotating]] the original array, causing elements at the edge to wrap around (giving a torus geometry). | A famous video by [[John Scholes]]<ref name="scholes">[[John Scholes|Scholes, John]]. [https://www.youtube.com/watch?v=a9xAKttWgP4 "Conway's Game of Life in APL"]. 2009-01-26.</ref> explains the following [[Dyalog APL]] implementation step by step. The implementation takes advantage of [[nested]] arrays and the [[Outer Product]] to produce many copies of the argument array. It finds adjacent elements by [[Rotate|rotating]] the original array, causing elements at the edge to wrap around (giving a torus geometry). | ||
<source lang=apl> | <source lang=apl> | ||
life ← {⊃1 ⍵ ∨.∧ 3 4 = +/ +⌿ ¯1 0 1 ∘.⊖ ¯1 0 1 ⌽¨ ⊂⍵} | |||
</source> | </source> | ||
This implementation is also explained [[John Scholes' Conway's Game of Life|in its own article]]. | This implementation is also explained [[John Scholes' Conway's Game of Life|in its own article]]. | ||