Скачать или смотреть Conway's game of life on micro:bits. Speed optimized code!

My previous code was running pretty slow, see    • Conway's Game Of Life on Multi Micro:bits ...  . The code was recursively checking the 8 neighbours of each cell in the matrix. There are 15x15 cells, each with 8 neighbours, for a total of 1800 checks at each step! I realized that technically I only need to check the cells the are currently live, and their neighbouring dead cells in case they may birth on the next step. All other dead cells I can ignore because there's no chance they can birth. So for the glider pattern, which has 5 live cells at the first step, and only 17 dead cells neighbouring the live ones, then I only need to check 22x8 = 176 times. This reduces the processing time and allows for faster animation as seen in this video. Of course, the larger amount of live cells in a step will increase the latency.