|7d8b7c3228||2 months ago|
|.github/workflows||2 months ago|
|.vscode||2 months ago|
|src||2 months ago|
|unholeycounters||2 months ago|
|.envrc||2 months ago|
|.gitignore||2 months ago|
|Cargo.lock||2 months ago|
|Cargo.toml||2 months ago|
|LICENSE||2 months ago|
|README.md||2 months ago|
|default.nix||2 months ago|
|flake.lock||2 months ago|
|flake.nix||2 months ago|
|notes.md||2 months ago|
|shell.nix||2 months ago|
fold square nets and verify if the're cuboid
There theoretically exists a square net consisting of 46 squares that can be folded into three distinct cuboids with dimensions: 1x1x11, 1x2x7, and 1x3x5. The problem is that there's no known way to find these nets other than brute-force, i.e. generating all possible nets with all possible folds and checking if they fold into valid cuboids. For lack of a better idea, that is what this project is aiming to do.
See nodes.md and https://tilde.town/~kindrobot/share/nets/ for notes and observations during the work thus far.
Is used for generating the number of unholey polyominoes (which we believe are a superset of the cuboid nets.)
Originally created by John Mason for https://oeis.org/A000104.
Compiling and running
With a modern JDK installed, you can
javac unholeycounters/UnholeyCounters.java java unholeycounters/UnholeyCounters countm90c:size=41,unholey=true none
The different subprograms of UnholeyCounters are documented here.
...is a hacker collective based on friendship. More information can be found at https://43beans.casa.
This project is licensed under the MDGPL. Please see LICENSE for details.