• mindbleach
    link
    fedilink
    English
    arrow-up
    1
    ·
    1 month ago

    The first edit gets you something like 8088 Corruption, which naively compared every 8x8 block of input video to every codepage 437 character in every color combination, then played from floppy to screen as quickly as possible. As an O(n2) algorithm it’s very easy to bloat beyond any hope of real-time use - especially as you make things more flexible with tile-flipping and so on. With a fixed-ish tileset you can at least speed up search by averaging colors or building some kind of tree.

    The second edit gets you that time I tried shoving Dragon’s Lair onto NES, and every clever tweak made it mushier.

    Actually - I think the first Command & Conquer homebrewed its own video format, using big chunky tiles. (MPEG1 decoding was bizarrely expensive in terms of both dollars and compute. And it still looked awful.) “The Bitter Lesson” tells us that’s a search problem we should attack with speed instead of complexity.

    So probably just K-means over all the tiles in your group-of-pictures.