ConwayLife.com

Hey Macbi, thank you so much for your answer!! This makes a lot of sense. Let me ask you something real quick:

If my goal inputs always have a dead border, lets say:


0 0 0 0 0 0
0 0 1 1 0 0
0 0 0 1 1 0
0 0 0 0 0 0


for example and the predecessor can have live cells at the edges in order ...

Hi! I'm trying to use LLS to find the minimal immediate predecessor with kissat as a solver but ran into a problem. For this input:

[EDIT] tested with lengeling and got the same result ...

I did! now, for better solutions we were cleared to use any existing solution, including SAT solvers and what not. It’s an AI class, hence the algorithms for exhaustive search, A* etc

Plus, I’m not really looking for a pre made solution, just a path to follow since I don’t really know where to go ...

I’ll check the links and lls, thanks for the help! Btw, I’ve seen it’s written in python, is there a similar one in C? I can only use C for this assignment

Thanks! I’ll take a look. The problem I found with sat solvers, at least the way I used em, was that even though they find a valid board, there is no guarantee it’s a minimal one, so I ended up minimizing the whole search space still, which is exponential in the size of the input.

Basically I’m ...

I know conway's game of life is not reversible, but can any one state be found that generates a given board and has a min number of cells? Or at least close to min as possible?

Given a configuration like this:

`0 0 0 0 0 0`
`0 0 1 1 0 0`
`0 0 0 1 1 0`
`0 0 0 0 0 0`


A possible state that ...