Yeah it is a bit different from an ordinary contact process.
The theory for these kind of stuff that I am familiar with hold on lattices of the type 
. Which is in some sense a lattice on 
So it might be fun to explore what kind of results you get if you implement this kind of stuff on a torus.
I could check it out and try the implementation though I am unsure about pygame in its ability to handle the 3rd dimension. I mean python already does O(nlogn) algorithms as O(n2)
So I will definitely look into it but it might take a little longer to implement this into 3d (for application) than it did for 2d
I mean a 2d torus (S x S). By identifying the opposite edges on a square you can create a torus.
Yes but it would be prettier to look at if it was a complete torus, as well I can just write it in C++ and have it work a lot faster