I've had this idea since 2009: converting the integer factorization problem into a visual geometric constraint puzzle (based on Lattice/Gelosia multiplication). The idea is to see if we can spot symmetry-breaking patterns in the 'carry' bits, or constraints on the remainders/quotients over some radix based on divisibility implications of already selected units in the tableaux. In other words, the kind of domain-specific things that "domain-blind" SAT solvers miss.
It features:
- Arbitrary Radix support (Base-2 to Base-Infinity)
- Entropy Heatmaps to see constraints propagating
- Miller-Rabin prime generation
- It runs entirely in the browser.
Just somethng fun to play with to give you a feel for the puzzle. Definitely could improve a lot more!
VogonPoetry•2mo ago
To get feedback / commentary you likely need to change the permissions on the repository, currently it seems to be private.
keepamovin•2mo ago
You mean the pages doesnt open? Thank you for that… and for all the fish
VogonPoetry•2mo ago
I see a different error now - a 404 with "There isn't a GitHub Pages site here".
keepamovin•2mo ago
Ah yes when i switched it public the old “obfuscated” url is gone. I posted normally, but it needs a bit of work still. You can play tho
keepamovin•2mo ago
It features:
- Arbitrary Radix support (Base-2 to Base-Infinity)
- Entropy Heatmaps to see constraints propagating
- Miller-Rabin prime generation
- It runs entirely in the browser.
Just somethng fun to play with to give you a feel for the puzzle. Definitely could improve a lot more!
VogonPoetry•2mo ago
keepamovin•2mo ago
VogonPoetry•2mo ago
keepamovin•2mo ago