43beans
/
foldnet
7
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
A 43bean R&D initiative to find a square net (AKA development) that can fold into three different cuboids with a surface area of 46.
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
9 Commits
1 Branch
0 Tags
550 KiB
Java 82%
Rust 16.7%
Nix 1.3%
 
 
 
main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'main'
${ noResults }
Go to file
Stef Dunlap 7d8b7c3228 Add notes and unholeycounters 2 months ago
.github/workflows Initial commit with nets 2 months ago
.vscode Add notes and unholeycounters 2 months ago
src folding 2 months ago
unholeycounters Add notes and unholeycounters 2 months ago
.envrc Initial commit with nets 2 months ago
.gitignore Initial commit with nets 2 months ago
Cargo.lock Initial commit with nets 2 months ago
Cargo.toml Initial commit with nets 2 months ago
LICENSE Add license 2 months ago
README.md Add notes and unholeycounters 2 months ago
default.nix Initial commit with nets 2 months ago
flake.lock Initial commit with nets 2 months ago
flake.nix Add notes and unholeycounters 2 months ago
notes.md Add notes and unholeycounters 2 months ago
shell.nix Initial commit with nets 2 months ago

README.md

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.