Elementary cellular automaton/Infinite length: Difference between revisions
Elementary cellular automaton/Infinite length (view source)
Revision as of 15:43, 14 August 2018
, 5 years agoAdded Go
SqrtNegInf (talk | contribs) m (→{{header|Perl}}: revised use of $_) |
(Added Go) |
||
Line 209:
##.####..##.#..###.#...#..####...#..#.##.######
##..#...###..####...##.#####...#.#####.#..#.....#
</pre>
=={{header|Go}}==
{{trans|C++}}
<lang go>package main
import (
"fmt"
"strings"
)
func btoi(b bool) int {
if b {
return 1
}
return 0
}
func evolve(l, rule int) {
fmt.Printf(" Rule #%d:\n", rule)
cells := "O"
for x := 0; x < l; x++ {
cells = addNoCells(cells)
width := 40 + (len(cells) >> 1)
fmt.Printf("%*s\n", width, cells)
cells = step(cells, rule)
}
}
func step(cells string, rule int) string {
newCells := new(strings.Builder)
for i := 0; i < len(cells)-2; i++ {
bin := 0
b := uint(2)
for n := i; n < i+3; n++ {
bin += btoi(cells[n] == 'O') << b
b >>= 1
}
a := '.'
if rule&(1<<uint(bin)) != 0 {
a = 'O'
}
newCells.WriteRune(a)
}
return newCells.String()
}
func addNoCells(cells string) string {
l, r := "O", "O"
if cells[0] == 'O' {
l = "."
}
if cells[len(cells)-1] == 'O' {
r = "."
}
cells = l + cells + r
cells = l + cells + r
return cells
}
func main() {
for _, r := range []int{90, 30} {
evolve(25, r)
fmt.Println()
}
}</lang>
{{out}}
<pre>
Rule #90:
..O..
..O.O..
..O...O..
..O.O.O.O..
..O.......O..
..O.O.....O.O..
..O...O...O...O..
..O.O.O.O.O.O.O.O..
..O...............O..
..O.O.............O.O..
..O...O...........O...O..
..O.O.O.O.........O.O.O.O..
..O.......O.......O.......O..
..O.O.....O.O.....O.O.....O.O..
..O...O...O...O...O...O...O...O..
..O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O..
..O...............................O..
..O.O.............................O.O..
..O...O...........................O...O..
..O.O.O.O.........................O.O.O.O..
..O.......O.......................O.......O..
..O.O.....O.O.....................O.O.....O.O..
..O...O...O...O...................O...O...O...O..
..O.O.O.O.O.O.O.O.................O.O.O.O.O.O.O.O..
..O...............O...............O...............O..
Rule #30:
..O..
..OOO..
..OO..O..
..OO.OOOO..
..OO..O...O..
..OO.OOOO.OOO..
..OO..O....O..O..
..OO.OOOO..OOOOOO..
..OO..O...OOO.....O..
..OO.OOOO.OO..O...OOO..
..OO..O....O.OOOO.OO..O..
..OO.OOOO..OO.O....O.OOOO..
..OO..O...OOO..OO..OO.O...O..
..OO.OOOO.OO..OOO.OOO..OO.OOO..
..OO..O....O.OOO...O..OOO..O..O..
..OO.OOOO..OO.O..O.OOOOO..OOOOOOO..
..OO..O...OOO..OOOO.O....OOO......O..
..OO.OOOO.OO..OOO....OO..OO..O....OOO..
..OO..O....O.OOO..O..OO.OOO.OOOO..OO..O..
..OO.OOOO..OO.O..OOOOOO..O...O...OOO.OOOO..
..OO..O...OOO..OOOO.....OOOO.OOO.OO...O...O..
..OO.OOOO.OO..OOO...O...OO....O...O.O.OOO.OOO..
..OO..O....O.OOO..O.OOO.OO.O..OOO.OO.O.O...O..O..
..OO.OOOO..OO.O..OOO.O...O..OOOO...O..O.OO.OOOOOO..
..OO..O...OOO..OOOO...OO.OOOOO...O.OOOOO.O..O.....O..
</pre>
| |||