HN Explorer

18 comments

[ 2.2 ms ] story [ 44.1 ms ] thread
fredley
The amount of high level research-and cool new results-that continue to be found in GoL is amazing.
ttoinou
The FFT version is interesting

   G∗K == F⁻¹( F(G)·F(K) )
So if we iterate t times (as in t step in time) this do we get this formula (convolution product being associative) ?

   ((G∗K)*K)*K ... t time = G∗K^t == F⁻¹( F(G)·F(K^t) )
moopling
If you assume K is unchanging, yes. Like if it were a fixed point on the board.
ttoinou
The kernel doesn't change in Smooth Life, right ?
no_identd
Hmm... I now wonder if it'd make sense to make a version of this that uses Constant Q instead of Fourier transforms...
no_identd
...and I also wonder why this still uses a square lattice on the bottom layer - shouldn't a continuous version permit the use of a hexagonal lattice, which doesn't work that well within the discrete domain (although people have attempted it not that unsuccessful, but it still had issues.)
Thorondor
No, because the transition function has to be applied at each time step as well as the convolution. In the source code, that's

    self.rules.s(N_buffer, M_buffer)
ttoinou
Okay thanks ! Makes it more interesting. I like it when it's doing something in one space (fourier space here) then something else in another space (original space) and you have to switch between multiple point of view to make something awesome (a fractal for example)
plaidfuji
For some reason I assumed they were referring to the board game "LIFE" and had developed a continuous version with respect to the money (so that things weren't always in increments of $10,000). Not sure how having children would work on a continuous domain though.
swiley
They would be some sort of probability distribution.
hmartiros
This is really neat, thanks for sharing.