Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2024-08-03 06:47:26 +0200 | commented answer | Tiling solver: finite limits for reusable pieces Thank you, this is very helpful. I am very much a novice when it comes to writing code in general, but this is a very cl |
| 2024-08-03 06:37:22 +0200 | marked best answer | Tiling solver: finite limits for reusable pieces I am hoping someone can explain to me how to get the Tiling Solver to work sensibly with finitely limited piece constraints. I tried adding multiple copies of given polyominos into the pieces list and setting reusable = False, but this was not handled sensibly by the iterator as it seemed to be viewing permutations of identical pieces as distinct solutions, and therefore finding absurdly many solutions. If there is no way to do this currently, it seems like a worthy feature to implement. Thank you! |
| 2024-08-03 06:37:22 +0200 | received badge | ● Scholar (source) |
| 2024-08-03 06:37:09 +0200 | received badge | ● Supporter (source) |
| 2024-07-27 17:56:44 +0200 | received badge | ● Student (source) |
| 2024-07-27 17:54:21 +0200 | asked a question | Tiling solver: finite limits for reusable pieces Tiling solver: finite limits for reusable pieces I am hoping someone can explain to me how to get the Tiling Solver to w |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.