Spectrum Computing

Hmm, that seems like a good idea. I don't think a lookup table would be appropriate in this case, as the extra memory needed for the code and the table itself would outweigh saving 40 bytes or so in the font data. Maybe a hardcoded test or CP instruction would work though. Or the character set could...

Woohoo, 35 bytes! Always great to see compact routines like this. Perhaps it could be tweaked for more efficient storage of the font though? I don't mind so much the wasted bits per character pair, but spreading out over 7 256b pages seems worth optimizing. Nevertheless, this is quite an achievemen...

I'd be interested to know the details of how you're planning to store the tree in memory, since I'm also considering using Huffman coding for in-game text in my own project. Storing the tree as a structure of nodes and pointers seems to me like it would use a lot of memory, but at least it would be ...

I started learning Z80 assembly several years ago but I didn't really do anything with it apart from a few flashy screen effects. So now I've decided to come back to it and attempt to make an actual game, starting with this text routine. It's optimized to be as small as possible (34/35 bytes), with...

Hello everyone, this is my first post on these forums. :) I started learning Z80 assembly several years ago but I didn't really do anything with it apart from a few flashy screen effects. So now I've decided to come back to it and attempt to make an actual game, starting with this text routine. It's...