Space invaders in least number of bytes?
I heard about Space invaders competitions where the working implementation with the fewest number of bytes wins. Do you have any examples, links, stories to tell etc from this type of competition? The one space invaders code golf I heard about probably had all competing in Microsoft assembler but there could be also other formats. Is there an official record for implementing space invaders in the least number of bytes just like there was discussion how to implement hello world in very for bytes?
Space invaders in least number of bytes?
===

I heard about Space invaders competitions where the working implementation with the fewest number of bytes wins. Do you have any examples, links, stories to tell etc from this type of competition? The one space invaders code golf I heard about probably had all competing in Microsoft assembler but there could be also other formats. Is there an official record for implementing space invaders in the least number of bytes just like there was discussion how to implement hello world in very for bytes?