I am a PhD candidate in theoretical computer science in Amsterdam. My work focuses on the intersection of multi-agent path finding (MAPF) with epistemic planning. Besides that I like computer chess, chess variants, mathematics, and reading.
Maurice Dekker and Gregor Behnke 2024. "Barely Decidable Fragments of Planning". In Proceedings of the 27th European Conference on Artificial Intelligence, pp. 4198-4206.
Version 2.0 (12 December 2025) (changelog) Choose a level and apply actions to reach the goal state 11111111. An action is applicable if it matches the current state. Applying an action changes zeroes into ones and vice versa. Beginner: Intermediate: Advanced: Expert: Errors: - (- in current branch) Depth: -