Show HN: Game of Life on non-square topologies with 2^32 update rules

Hi HN, when learning Golang (and topology), I ported a simple GOL in C (https://github.com/Jeadie/GoL) into Go. I then added a bunch of features - Playing on other fundamental polygons (https://en.wikipedia.org/wiki/Fundamental_polygon#Examples_o...) - Considering all possible update rules (of which, there are many).

Looking to get back to this project soon. Would love some feedback + ideas.