Squares in Squares
Find the smallest enclosing square for N unit squares
Official pageOpen the competition on Kaggle↗
- Effort
- 5–15 hours
- Difficulty
- Beginner
- Compute
- CPU only
- Scoring
- Automatic
At a glance
Full rules ↗- Scoring
- Squares in Squares
- Teams
- Up to 5 per team
- Submitting
- Up to 10 a day
Is it for you?
Strong first competition
Beginner fit84/100
Learning value69/100
The editors' notes, in Chinese; there is no English translation yet.
Who it suits
适合具备计算几何与连续优化背景的人，能够为不同 n 设计单位正方形的无重叠排布，并用启发式或学习方法搜索更紧的轴对齐外包正方形。也适合能按指定 CSV 格式生成坐标和弧度旋转角、愿意只从部分题目开始迭代的人。
What makes it hard
难点是同时满足旋转后正方形的严格无重叠约束，并在 1,000 个规模不同的问题上尽量压低外包正方形边长；这不是预测任务，提交的连续坐标本身必须构成有效几何构型。漏交题目会按平凡网格排布计分，因此要在搜索高质量构型与覆盖更多题目之间权衡。
Getting started
Skills to bring
In Chinese; there is no English translation yet.
- 计算几何
- 连续优化
- 碰撞检测
- 模拟退火
- 进化算法
- CSV 文件生成
We haven't pulled tutorials, data or baselines from the official page yet; the task and the data are there.
First competition? Read No GPU? Pick Competitions That Still Teach You Good Habits