Summary: Most readers are familiar with cellular automata (CA) utilizing squares as cells, and are also familiar with the most famous automaton, Conway’s Game of Life. This game is played on an infinite grid of squares, and has been thoroughly explored in many publications as well as on numerous websites. In 1994 in this journal the author introduced several games of life in the triangular tessellation [Complex Syst. 8, No. 1, 67–73 (1994;

Zbl 0825.68467)]. It now appears, not surprisingly, that other tessellations also support games of life.