From Daan
MeesterDaan (talk | contribs) |
MeesterDaan (talk | contribs) |
||
| Line 8: | Line 8: | ||
|- | |- | ||
| − | |valign="top" |[[Image:LeuvenSolution.jpg| | + | |valign="top" |[[Image:LeuvenSolution.jpg|upright=2|frameless|link=Amstelhaege|Solution found on server of Cees van Leeuwen (PDL, Uni Leuven) and with help of Marco Maas.]] |
|} | |} | ||
</Center> | </Center> | ||
Revision as of 14:03, 16 November 2016
ASQAS-34 is a perfect rectangle packing problem solved by Braam, Moes, Suilen, Van den Berg and Bhulai in 2016 and earlier (unpublished) by Giovanni Resta. I'm still working on this page, but our paper is here. I (Daan) welcome all feedback you might have.
| The Leuven Solution |
|---|
|