I'm a simple person. I see an assembly implementation of Conway's Game Of Life, I download it and try it. But when I see that it is *only* 178 bytes on calc, then you my friend have really piqued my curiosity. My name may be Zeda, but I'll be frank with you: I did not believe that was possible. No freaking way. I double checked the author, too. Was it Iambian? Calc84? Runer112? Jacobly? NOPE.

If the author isn't one of the Z80 calculator deities, then it must be that they heavily relied on OS syscalls, right? That would be slow as *heck*. So, I tried it. It was smooth, it was fast, and it looked cool. I opened the source and I'll just say it: It's beautiful. It isn't perfect (as the author notes), but it is quite close.

This code is elegant, and the program is simple, to-the point, and looks cool (that's CGOL for you!).

This gets a 10/10 from me-- I am thoroughly impressed.

The only improvements I would ask for are: A way for the user to submit their own starting states, and 15MHz mode (cross compatible: in a,(2) \ add a,a \ sbc a,a \ out (20h),a).