Just a simple RLE algorithm for a project in the works. Mainly just a silly project. Regardless this algorithm is used to compress ascii maps down to a smaller file size. It does this by using a run-length encoding algorithm.
TL;DR
Small Scale
Uncompressed map is 2kb
Compressed map is 758 bytes
Big(ger) Scale
Uncompressed map is 86kb
Compressed map is 42kb
So over half size saved.
There is still room for improvement, but I can't be too bothered right now