5 replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/

n%{.,,{1${.0=,:w[1,*]\+2*>3<}:^~{zip^''+.4=5%'X '@{+}*(7&1>'iX'>+=}+w,%}%"\033[H\033[J"@n*+puts 6.?.?}do  Note that I'm counting the \033 as one character each, because they can be replaced by a literal ESC character. This uses ANSI control codes, so relies on a compatible tty. Also note that frames are printed starting with the input grid. There is some overlap with Generate a grid of sumsGenerate a grid of sums, which also uses the Moore neighbourhood. Encoding: blank space => ; electron head => i; electron tail => ; copper => X. The pause between iterations is the time required to calculate 4665646656. Changing 6.?.? to another expression allows you to control the speed; the next slowest for the same character count is 7.?.?, which is much slower (the output is 22 times as big, and it's not a linear complexity calculation). For a test case, I've been using iXXXXXXXXX X X XXX X X iXX XXXXXX  from the Rosetta Code Wireworld challenge. ## GolfScript (125 120 105 100 chars) n%{.,,{1${.0=,:w[1,*]\+2*>3<}:^~{zip^''+.4=5%'X '@{+}*(7&1>'iX'>+=}+w,%}%"\033[H\033[J"@n*+puts 6.?.?}do


Note that I'm counting the \033 as one character each, because they can be replaced by a literal ESC character. This uses ANSI control codes, so relies on a compatible tty. Also note that frames are printed starting with the input grid.

There is some overlap with Generate a grid of sums, which also uses the Moore neighbourhood.

Encoding: blank space => ; electron head => i; electron tail => ; copper => X.

The pause between iterations is the time required to calculate 4665646656. Changing 6.?.? to another expression allows you to control the speed; the next slowest for the same character count is 7.?.?, which is much slower (the output is 22 times as big, and it's not a linear complexity calculation).

For a test case, I've been using

iXXXXXXXXX
X   X
XXX
X   X
iXX XXXXXX


from the Rosetta Code Wireworld challenge.

n%{.,,{1${.0=,:w[1,*]\+2*>3<}:^~{zip^''+.4=5%'X '@{+}*(7&1>'iX'>+=}+w,%}%"\033[H\033[J"@n*+puts 6.?.?}do  Note that I'm counting the \033 as one character each, because they can be replaced by a literal ESC character. This uses ANSI control codes, so relies on a compatible tty. Also note that frames are printed starting with the input grid. There is some overlap with Generate a grid of sums, which also uses the Moore neighbourhood. Encoding: blank space => ; electron head => i; electron tail => ; copper => X. The pause between iterations is the time required to calculate 4665646656. Changing 6.?.? to another expression allows you to control the speed; the next slowest for the same character count is 7.?.?, which is much slower (the output is 22 times as big, and it's not a linear complexity calculation). For a test case, I've been using iXXXXXXXXX X X XXX X X iXX XXXXXX  from the Rosetta Code Wireworld challenge. 4 deleted 1 characters in body ## GolfScript (125 120 105105100 chars) n%{.,,{1${.0=,:w[1,*]\+2*>3<{{0\+*]\+2*>3<}%zip>3<''+:^~{zip^''+.4=5%'X '@{+}*(7&1>'iX'>+=}+w,%}%"\033[H\033[J"@{n}%+puts%"\033[H\033[J"@n*+puts 6.?.?}do


Note that I'm counting the \033 as one character each, because they can be replaced by a literal ESC character. This uses ANSI control codes, so relies on a compatible tty. Also note that frames are printed starting with the input grid.

There is some overlap with Generate a grid of sums, which also uses the Moore neighbourhood.

Encoding: blank space => ; electron head => i; electron tail => ; copper => X.

The pause between iterations is the time required to calculate 4665646656. Changing 6.?.? to another expression allows you to control the speed; the next slowest for the same character count is 7.?.?, which is much slower (the output is 22 times as big, and it's not a linear complexity calculation).

For a test case, I've been using

iXXXXXXXXX
X   X
XXX
X   X
iXX XXXXXX


from the Rosetta Code Wireworld challenge.

n%{.,,{1$.0=,:w[1,*]\+2*>3<{{0\+}%zip>3<''+.4=5%'X '@{+}*(7&1>'iX'>+=}+w,%}%"\033[H\033[J"@{n}%+puts 6.?.?}do  Note that I'm counting the \033 as one character each, because they can be replaced by a literal ESC character. This uses ANSI control codes, so relies on a compatible tty. Also note that frames are printed starting with the input grid. There is some overlap with Generate a grid of sums, which also uses the Moore neighbourhood. Encoding: blank space => ; electron head => i; electron tail => ; copper => X. The pause between iterations is the time required to calculate 4665646656. Changing 6.?.? to another expression allows you to control the speed; the next slowest for the same character count is 7.?.?, which is much slower (the output is 22 times as big, and it's not a linear complexity calculation). For a test case, I've been using iXXXXXXXXX X X XXX X X iXX XXXXXX  from the Rosetta Code Wireworld challenge. ## GolfScript (125 120 105100 chars) n%{.,,{1${.0=,:w[1,*]\+2*>3<}:^~{zip^''+.4=5%'X '@{+}*(7&1>'iX'>+=}+w,%}%"\033[H\033[J"@n*+puts 6.?.?}do


Note that I'm counting the \033 as one character each, because they can be replaced by a literal ESC character. This uses ANSI control codes, so relies on a compatible tty. Also note that frames are printed starting with the input grid.

There is some overlap with Generate a grid of sums, which also uses the Moore neighbourhood.

Encoding: blank space => ; electron head => i; electron tail => ; copper => X.

The pause between iterations is the time required to calculate 4665646656. Changing 6.?.? to another expression allows you to control the speed; the next slowest for the same character count is 7.?.?, which is much slower (the output is 22 times as big, and it's not a linear complexity calculation).

For a test case, I've been using

iXXXXXXXXX
X   X
XXX
X   X
iXX XXXXXX


from the Rosetta Code Wireworld challenge.

3 deleted 83 characters in body

## GolfScript (125 120120105 chars)

n%{.,,{1$.0=,:w['0'*]\+>3<ww[1,*]\+2*>3<{1${'0'\+0\+}%zip>3<%zip>3<''+.1=1=33/4,1^@'7'+4=5%'X '@{+}*7&1>2*)+=}%\;{' 1x'=*(7&1>'iX'>+=}+w,%}%\'\033[H\033[J'\%"\033[H\033[J"@{n}%+print%+puts 6.?.?}do


Note that I'm counting the \033 as one character each, because they can be replaced by a literal ESC character. This uses ANSI control codes, so relies on a compatible tty. Also note that frames are printed starting with the input grid.

There is some overlap with Generate a grid of sums, which also uses the Moore neighbourhood.

Encoding: blank space => ; electron head => 1i; electron tail => ; copper => xX.

The pause between iterations is the time required to calculate 4665646656. Changing 6.?.? to another expression allows you to control the speed; the next slowest for the same character count is 7.?.?, which is much slower (the output is 22 times as big, and it's not a linear complexity calculation).

For a test case, I've been using

1xxxxxxxxxiXXXXXXXXX
xX   xX
xxxXXX
xX   xX
1xxiXX xxxxxxXXXXXX


from the Rosetta Code Wireworld challenge.

I expect that this can be reduced to about 100 chars with more work.

## GolfScript (125120 chars)

n%{.,,{1$.0=,:w['0'*]\+>3<w,{1${'0'\+}%zip>3<.1=1=33/4,1^@'7'+{+}*7&1>2*)+=}%\;{' 1x'=}%}%\'\033[H\033[J'\{n}%+print 6.?.?}do


Note that I'm counting the \033 as one character each, because they can be replaced by a literal ESC character. This uses ANSI control codes, so relies on a compatible tty. Also note that frames are printed starting with the input grid.

There is some overlap with Generate a grid of sums, which also uses the Moore neighbourhood.

Encoding: blank space => ; electron head => 1; electron tail => ; copper => x.

The pause between iterations is the time required to calculate 4665646656. Changing 6.?.? to another expression allows you to control the speed; the next slowest for the same character count is 7.?.?, which is much slower (the output is 22 times as big, and it's not a linear complexity calculation).

For a test case, I've been using

1xxxxxxxxx
x   x
xxx
x   x
1xx xxxxxx


from the Rosetta Code Wireworld challenge.

I expect that this can be reduced to about 100 chars with more work.

## GolfScript (125 120105 chars)

n%{.,,{1\$.0=,:w[1,*]\+2*>3<{{0\+}%zip>3<''+.4=5%'X '@{+}*(7&1>'iX'>+=}+w,%}%"\033[H\033[J"@{n}%+puts 6.?.?}do


Note that I'm counting the \033 as one character each, because they can be replaced by a literal ESC character. This uses ANSI control codes, so relies on a compatible tty. Also note that frames are printed starting with the input grid.

There is some overlap with Generate a grid of sums, which also uses the Moore neighbourhood.

Encoding: blank space => ; electron head => i; electron tail => ; copper => X.

The pause between iterations is the time required to calculate 4665646656. Changing 6.?.? to another expression allows you to control the speed; the next slowest for the same character count is 7.?.?, which is much slower (the output is 22 times as big, and it's not a linear complexity calculation).

For a test case, I've been using

iXXXXXXXXX
X   X
XXX
X   X
iXX XXXXXX


from the Rosetta Code Wireworld challenge.

2 Correction: two missing characters at the start; save 5 by micro-optimisations
1