https://github.com/ndsvw/box-stacking-problem
Dynamic-Programming solution of the "Box stacking"-Problem: Given a set of N rectangular 3-D boxes. What is the highest possible stack you can create with them? Only strictly smaller boxes are allowed on top of each other (2D-based); rotation is allowed.
https://github.com/ndsvw/box-stacking-problem
3d algorithm algorithm-challenge complexity-analysis dynamic-programming
Last synced: 4 months ago
JSON representation
Dynamic-Programming solution of the "Box stacking"-Problem: Given a set of N rectangular 3-D boxes. What is the highest possible stack you can create with them? Only strictly smaller boxes are allowed on top of each other (2D-based); rotation is allowed.
- Host: GitHub
- URL: https://github.com/ndsvw/box-stacking-problem
- Owner: ndsvw
- License: mit
- Created: 2020-03-14T13:31:34.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2020-03-15T06:57:36.000Z (over 5 years ago)
- Last Synced: 2025-01-14T02:26:12.048Z (6 months ago)
- Topics: 3d, algorithm, algorithm-challenge, complexity-analysis, dynamic-programming
- Language: Python
- Size: 3.91 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0