TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

A Polyomino Tiling Algorithm (2018)

37 点作者 brucehauman2 个月前

1 comment

fjfaase2 个月前
Interesting. I am going to have a look at this. In the past year, I have been working at an algorithm on how many paper cubes one can make out of a rectangle sheet of paper. There are 11 polyomino's that can be folded into a cube. It is impossible to exactly fill a rectangle (with integer size) completely with those polyomino's. So, you also will need some holes, squares that are not covered.