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

>>27
If you're interested in cellular automata you should get Golly 2.0 It's an editor and simulator for many different rules.

It also has that prime calculating computer as an example. But the awesome thing is, you can speed shit up and see that the computer actually works.