Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Can automated theorem proving software be coaxed into finding recipes for GOL constructions?

I would find it interesting trying to formalize notions that we easily perceive into computer-understood definitions.

May end up with strange formalizations to make things as orthogonal as possible: IE a beehive is a glider speed zero.



I have a program called LLS that uses SAT solvers to find patterns with specified properties. https://conwaylife.com/wiki/Logic_Life_Search But it only works cell-by-cell, so it can't make big patterns like this.


SAT has been used to find many things in GoL. IIRC the first "grandfatherless" pattern was found with one.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: