Project
The task was to optimize a program that solves arbitrary instances of a magic hexagon written in C. We applied different ideas from the LVA, the task description and some from ourselves. With this we were able to manage a speedup of >113x in the end. Our group consists of the following students:
- Christoph Neubauer
- Matthias Preymann
- Philipp Vanek
Presentation
You can download the presentation we held here. We discuss the ideas we pursued including ones that turned out to be not working. Moreover, we present the final improvements we were able to achieve.
Repository
We tracked our code changes with git. You can find our repository on GitHub
Source code
Below you can find the final source code we worked on.
| Name | Type | Size |
|---|---|---|
| magichex.c | C source file | 16.8kB |
| Makefile | make file | 1.12kB |