Cellular Automaton, Part I

I have wrote a Wireworld CA program in Java and have realized how the OR-gate & XOR-gate works, but I'm still having problems with realizing the AND-gate. Anybody have some experience with this cellular automaton?


//The OR-gate:

0 0 0 0 0 0 0 0
0 3 3 3 0 0 0 0
0 0 0 0 3 0 0 0
0 0 0 3 3 3 3 0
0 0 0 0 3 0 0 0
0 2 1 3 0 0 0 0
0 0 0 0 0 0 0 0

//The XOR-gate:

0 0 0 0 0 0 0 0 0 0
0 2 1 3 0 0 0 0 0 0
0 0 0 0 3 0 0 0 0 0
0 0 0 3 3 3 3 0 0 0
0 0 0 3 0 0 3 3 3 0
0 0 0 3 3 3 3 0 0 0
0 0 0 0 3 0 0 0 0 0
0 2 1 3 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0

New prog challenge: write a program that compiles a useful subset of a HDL (you can make up your own) to a Wireworld program.  Show the usefulness of your compiler by writing a program that computes primes or draws dicks.

Hm, I remember there's someone who found a way to really speed up Conway's game of dicks by using some memoization technique.  I wonder if the same can be done for wireworld.