Penholodigital squares: Difference between revisions
Content added Content deleted
(Added XPL0 example.) |
m (→slightly faster: i meant +400) |
||
Line 1,062: | Line 1,062: | ||
-- to get the next square. That does mean we need to be a little smarter displaying progress, though. |
-- to get the next square. That does mean we need to be a little smarter displaying progress, though. |
||
-- We can also utilise a partial to avoid overflow and get 16 digits to work properly on 32-bit. |
-- We can also utilise a partial to avoid overflow and get 16 digits to work properly on 32-bit. |
||
-- We can also skip +199 if that ain't gona work and + |
-- We can also skip +199 if that ain't gona work and +400 on the next iteration instead, iyswim. |
||
-- We can also use a trivial integer-sized bitmask to check for duplicate digits, which won't hit any |
-- We can also use a trivial integer-sized bitmask to check for duplicate digits, which won't hit any |
||
-- problems (on Phix) up to at least 29 digits, or 61 digits on 64-bit, and start off with bitmask=1 |
-- problems (on Phix) up to at least 29 digits, or 61 digits on 64-bit, and start off with bitmask=1 |