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

>>26
You looked through Wikipedia too, didn't you? Also that computer's good, except by the time it had reached 100000 generations it had got up to 3.