|
|
||
|---|---|---|
| .github/workflows | Initial commit with nets | |
| .vscode | Add notes and unholeycounters | |
| src | folding | |
| unholeycounters | Add notes and unholeycounters | |
| .envrc | Initial commit with nets | |
| .gitignore | Initial commit with nets | |
| Cargo.lock | Initial commit with nets | |
| Cargo.toml | Initial commit with nets | |
| default.nix | Initial commit with nets | |
| flake.lock | Initial commit with nets | |
| flake.nix | Add notes and unholeycounters | |
| LICENSE | Add license | |
| notes.md | Add notes and unholeycounters | |
| README.md | Add notes and unholeycounters | |
| shell.nix | Initial commit with nets | |
foldnet
fold square nets and verify if the're cuboid
The problem
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.
Notes
See nodes.md and https://tilde.town/~kindrobot/share/nets/ for notes and observations during the work thus far.
unholeycounter
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.
43beans
...is a hacker collective based on friendship. More information can be found at https://43beans.casa.
License
This project is licensed under the MDGPL. Please see LICENSE for details.