the creator of aftermatter corp. (https://xitter.cf/t.co/e7TqX69Cls), shrike ⚡︎, contextplus (2k) and cargo install safeinstall. [email protected]
Joined September 2024
- Tweets27.9K
- Following2.1K
- Followers9.7K
- Likes74.1K
Sure! Here's how the tightest (known) packing of 67, 6767 and 676767 squares in a larger square looks like:
I made the most optimized algorithm to find out the tightest packing of n smaller squares in a larger square
test it out: forloopcodes.github.io/least… (runs on your gpu)
more details:
input: n (number of squares)
intermediate: s (side length)
output: [[x, y, angle]*n] (array of position of each square)
solver (squarepack): pack(n) returns (s, [[x, y, angle], …])
scale: n=100000 in about 4 s, 0.08 s in browser, n=1000001 in 0.2 s.
verifier: p_ij = ½ + (|cos φ| + |sin φ|)/2 − max_a |a·(c_i − c_j)|, φ = θ_j − θ_i
flow:
1. best of all in O(n): Grid ⌈√n⌉, Göbel strip/square families, L-extensions, the √7 family, DeVincentis,Wainwright 19, Schadt 50/171
2. cache lookup
3. tilted-block search: p×q block rotated 45°, remaining space filled by walls anchoring
4. numerical compaction: Penalty energy E = Σ max(0,penetration)² + Σ max(0,protrusion)², analytic gradient, L-BFGS, shrink s by bisection, basin-hopping.
github: github.com/forloopcodes/leas…
forloop retweeted
> Develop a mobile game directly FROM your phone, WITHOUT a PC plugged in anywhere and WITHOUT cloud computing :
1loop v1 is out!
Code directly on your phone, NO PC needed. The AI agent controls your phone natively, no extra hardware or computer connection required.
Or code on PC and transfer your project seamlessly.
GitHub link below ↓
xitter.cf/tpm_28/status/21128839…
It's crazy how <burning money for larp> have started to feel normal.
Like I <burned money for larp> that <larped a lot> and my immediate thought is "yeah, and?"
