Another btw: The extra compressed version could probably be a bit smaller
than that. When I coded the extra compression algorithm, I just used a lazy
algorithm that uses the first combination of triangles it finds. It could be
possible to search for a better combination of (adjacent) triangles by
searching more aggressively, but without optimizing this search in any way
it would take years. I think there could be some way of optimizing this search,
but I have been too lazy to think about it.
  Anyways, I think that the current algorithm is good enough.

-- 
main(i,_){for(_?--i,main(i+2,"FhhQHFIJD|FQTITFN]zRFHhhTBFHhhTBFysdB"[i]
):5;i&&_>1;printf("%s",_-70?_&1?"[]":" ":(_=0,"\n")),_/=2);} /*- Warp -*/

Post a reply to this message