From Daan
MeesterDaan (talk | contribs) (→Cases) |
MeesterDaan (talk | contribs) (→Cases) |
||
| Line 20: | Line 20: | ||
!(EN) Chips & Circuits | !(EN) Chips & Circuits | ||
|- | |- | ||
| − | | | + | | Schlumpymorty haidyhorty |
|valign="top" |[[Image:Asqas34los2_k.png|frame|link=Rush Hour|Snel!]] | |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:19, 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 |
|---|---|---|
| Schlumpymorty haidyhorty |  Snel! |
 Optimally configure logical gates. |
| Tegelzetten | Fruitvliegen | Radio Russia |
 Plaats onregelmatige tegelsets in een invoervak. |
 Vind het evolutietraject tussen twee fruitvliegsoorten. |
 Bear of Brodkast. |
| Lectures & Lesroosters | (Hier komt 'Forensics') | (under construction) |
 Rooster de zalen op Science Park. |
 Genetica: wie is de dnader? |
 Leeg. |