From Daan
MeesterDaan (talk | contribs) |
MeesterDaan (talk | contribs) (→Cases) |
||
Line 21: | Line 21: | ||
|- | |- | ||
|valign="top" |[[Image:Amstelhaege_k.jpg|frame|link=Amstelhaege|Je bent een planoloog. Richt een nieuwbouwwijk in.]] | |valign="top" |[[Image:Amstelhaege_k.jpg|frame|link=Amstelhaege|Je bent een planoloog. Richt een nieuwbouwwijk in.]] | ||
− | |valign="top" |[[Image:Asqas34los2_k. | + | |valign="top" |[[Image:Asqas34los2_k.png|frame|link=Rush Hour|Snel!]] |
|valign="top" |[[Image:chipsandcircuits2.jpg|frame|link=Chips & Circuits| Optimally configure logical gates.]] | |valign="top" |[[Image:chipsandcircuits2.jpg|frame|link=Chips & Circuits| Optimally configure logical gates.]] | ||
|- | |- |
Revision as of 14:18, 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 |
---|
Cases
AmstelHaege | Rush Hour | (EN) Chips & Circuits |
---|---|---|
Tegelzetten | Fruitvliegen | Radio Russia |
Lectures & Lesroosters | (Hier komt 'Forensics') | (under construction) |