porglezomp-misc / flapjack-fwop-solver Goto Github PK

Currently the cache is mostly full of zeros. Since it's less than half full, we'd get a good savings by storing K/V pairs instead of directly indexed keys. For fast lookup, we should store them ordered by key, and do a binary search in the file to find the solution.

Good to see some info about cache generation

Its nice to give people some information about what the code does.

We're working with a 5x5 grid, so we've got lots of symmetry we could take advantage of:

• Horizontal/vertical reflections
• 90º rotations

Depending on how the patterns collide, this could cut down the total size of the cache by 2x, 4x, 8x even.

Implementation ideas:
Have some system for deciding which orientation of a board is canonical (the numerically lowest one?) and only store that one, transforming all boards into canonical form before they're handled.