Game of life example(s)?

[iljah]

Does AMReX have example(s) of Conway's game of life? Preferably in C++. How would minimal parallel game look like in 1, 2 or 3d, without error checking, file i/o, etc.? Doesn't matter whether grid is periodic, etc.

[asalmgren]

I do not believe anyone has implemented the game of life in amrex but it would not be hard. Ann Almgren Senior Scientist; Dept. Head, Applied Mathematics Pronouns: she/her/hers

…

On Tue, Nov 12, 2024 at 5:06 AM Ilja ***@***.***> wrote: Does AMReX have example(s) of Conway's game of life? Preferably in C++. How would minimal parallel game look like in 1, 2 or 3d, without error checking, file i/o, etc.? Doesn't matter whether grid is periodic, etc. — Reply to this email directly, view it on GitHub <#4228>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/ACRE6YUUB534JMELENST5MT2AH4OFAVCNFSM6AAAAABRUATMEGVHI2DSMVQWIX3LMV43ERDJONRXK43TNFXW4OZXGQ3DSOJRGE> . You are receiving this because you are subscribed to this thread.Message ID: ***@***.***>

[WeiqunZhang]

I guess it could be something like

Box domain(IntVect(0), IntVect(size-1));
BoxArray ba = amrex::decompose(domain, ParallelDescriptor::NProcs());
DistributionMapping dm{ba};

FabArray<BaseFab<bool>> state1(ba,dm,1,1);
FabArray<BaseFab<bool>> state2(ba,dm,1,1);

// initialize state1                                                                                                                                                         

for (int step = 0; ...) {
    state1.FillBoundary(Periodicity{domain.length()});
    auto const& a1 = state1.const_arrays();
    auto const& a2 = state2.arrays();
    ParllelFor(state1, [=] AMREX_GPU_DEVICE (int b, int i, int j, int k)
    {
        a2[b](i,j,k) = f(a1[b](i,j,k), a1[b](i-1,j,k), ...);
    });
    Gpu::streamSynchronize();
    std::swap(state1,state2);
}

[iljah]

Thank you