From Daan
MeesterDaan (talk | contribs) (→Q&A) |
MeesterDaan (talk | contribs) m (→Q&A) |
||
| Line 25: | Line 25: | ||
|- | |- | ||
| Stompycorky corkylorty | | Stompycorky corkylorty | ||
| − | |valign="top" |[[Image:thatsUs_k.jpg|frame|link=Heuristieken| | + | |valign="top" |[[Image:thatsUs_k.jpg|frame|link=Heuristieken|Left-to-right: Mark Moes, Emiel Suilen & Florian Braam who did most of the ground work. Bottom right is me (Daan van den Berg), I did coordination and wrote the first draft. Top right is Sandjai Bhulai who also did some writing and took care of the entire publication process]] |
|} | |} | ||
</Center> | </Center> | ||
Revision as of 14:33, 16 November 2016
Introduction
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 van den Berg) welcome all feedback you might have. Look me up in the UvA-directory, on LinkedIn or FaceBook.
Q&A
| A | B |
|---|---|
| Schlumpymorty haidyhorty |  This is Asqas-34: consecutive almost-square tiles to be fit in an almost-square frame. There are 5 instances of ASQAS, and ASQAS-34 was the only unsolved instance yet. |
| C | D |
| Krustylorty krustymorty |  Solution found on the server of Cees van Leeuwen's PDL lab @KU Leuven. Thanks to Marco Maas for helping out too. |
| E | F |
| Stompycorky corkylorty |  Left-to-right: Mark Moes, Emiel Suilen & Florian Braam who did most of the ground work. Bottom right is me (Daan van den Berg), I did coordination and wrote the first draft. Top right is Sandjai Bhulai who also did some writing and took care of the entire publication process |