4 ms·
Is that really the theoretically smallest? I think you can prove that some states representable by your proposal are unreachable. E.g. a board with 16 2s. So t
by dmurray 1y ago
Is that really the theoretically smallest?
I think you can prove that some states representable by your proposal are unreachable. E.g. a board with 16 2s. So there might be another bit to spare.
- YurgenJurgensen 1y agoAlthough at that point, your attempts to cut the state will probably resemble a look-up table enumerating every valid board state, which obviously balloons the executable size by a large amount.
- whereismyacc 1y agoyes but there could conceivably be better tricks to discover
- shiandow 1y agoIt ought to be possible to generate valid states ordered by total value and lexicographical order or something. But whether that is practical is a different matter. It does allow you to unambiguously define state #5546335 with the lowest number of bits
- sltkr 1y agoIt's not quite literally the smallest, but the interesting question is what fraction of all states represent such unreachable states.