Tim Kunt

works
about
misc



Filter by
Medium:
 Topic:
Integer Programming, Graph Theory, Cultural Theory, Chess, Rating Algorithms
  Institution:
Zuse Institute Berlin, University of the Arts Berlin,
Technical University Berlin, Humboldt University Berlin

Schau24 2024
for and with UdK Fashion

Show, University of the Arts Berlin, Integer Programming
Production for the 2024 Schau at the Institute of Experimental Fashion and Textile Design, University of the Arts Berlin.

The n-Queens Problem in Higher Dimensions
2023 
Thesis, Integer Programming, Graph Theory, Chess, Technical University Berlin
How many mutually non-attacking queens can be placed on a d-dimensional chessboard of size n? We provide a comprehensive overview on theoretical results, bounds, solution methods and the interconnectivity of the problem within topics of discrete optimization and combinatorics.
We present an integer programming formulation and several strengthenings, achieving a speedup in runtime between 15-70x over all instances.

MSc Thesis at Technical University Berlin, Institute of Mathematics, Discrete und Algorithmic Mathematics, supervised by Prof. Dr. Thorsten Koch

Dissonance  Within 2023 
with Özcan Ertek, Jung Hsu, Fang Tsai and Erik Anton Reinhardt

Show, Cultural History and Theory
Participatory exhibition at Zwitschermaschine Berlin.

Dall-ix 2023
with Erik Anton Reinhardt

Game, Cultural History and Theory

Historically, intelligence is perceived as human through play, as it is apparent from human-to-human cultural practice and software benchmarking by having it compete against itself or human professionals. 
Recently, responses that are not verifiable have led to the perception of intelligence increasingly shifting towards plausibility instead. We demonstrate that cultural affirmation is desired, or even necessary, for human plausibility and, thus, the perception of intelligence. 
Variation on the card game Dixit.

TSP Racer  v1
2023 
Game, Integer Programming, Graph Theory, Zuse Institute Berlin
Technical prototype for a racing game, that illustrates the travelling salesperson problem. The shortest route might not always be the fastest, prompting the question how searching for the fastest tour could be modeled.

Developed for Long Night of Sciences,  Zuse Institute Berlin

Computing bounds for ranks and qualification of the DPC
2023 
Blog, Integer Programming, DotA, Zuse Institute Berlin
 The Elimination Problem in sports asks whether a team can still achieve a particular result given the current standings of the league and its structure. 
In DotA, the major goal of many teams during a season is to qualify for The International (TI), as its prize money and prestige are unmatched. This motivates the question to find individual provable bounds for qualification to TI — in other words: How many points does a certain team need to be qualified for TI at a given point in time?

More stitches, less riches
2023 
Software, University of the Arts Berlin
In More stitches, less riches the dolphin fresco of the Minoan palace of Knossos continuously extends, applying outpainting methods. Viewers may engage in the process of restoration, decay and distortion. The work connects the exploitative management of the archaeological site to the question, whether a similar distorting effect on the cultural cycle is emergent through generative models.