I am a postdoctoral fellow in Professor Christian Schulz's Algorithm Engineering group at Heidelberg University. My research focuses on making hard graph problems tractable in practice using data reduction rules, local search, and graph neural networks. Some of the problems I have worked on include Independent Set, Dominating Set, Graph Coloring, and Graph Partitioning.

Solved solitaire dice games

Play against a computer opponent who is playing perfect solitaire Yatzy. Every expected value shown is a lookup in a precomputed table covering every reachable position. All games utilize the free variant where cells can be filled in any order.

After each game, you get a breakdown showing your performance against the perfect solitaire strategy.

Education

Competitions

Papers

Solver descriptions and reports

Teaching

Co-supervised students

Work experience

Service

Reviewer
SOFSEM 2026, IPEC 2025, ESA 2025, SWAT 2024, Nature Communications
Programme committee
CompAI 2025
Funding
NORA National Research School for AI, project 331723, 30 000 NOK
Meltzer Research Fund, project 104066111, 18 700 NOK
Doctoral coursework
Supercomputing Algorithms, Parallel Programming, Deep Learning
Languages
C and C++ with OpenMP/MPI by preference. Also x86 assembly, Java, C#, JavaScript, Python, SQL and Haskell