项目作者: ndsvw

项目描述 :
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.
高级语言: Python
项目地址: git://github.com/ndsvw/Box-Stacking-Problem.git
创建时间: 2020-03-14T13:31:34Z
项目社区:https://github.com/ndsvw/Box-Stacking-Problem

开源协议:MIT License

下载