| Year |
Student |
Thesis | Supervisors | Programme | Content |
|---|
| 2025‑2026 | Prooijen, S. van (Simon) | Constructing Maximally Difficult Sliding-Block Puzzles Using State Spa... | Vliet van, dr. R., Bergh van den, dr. M.J.H. | Inf | |
| 2025‑2026 | Lelipaly, J. (Joshua) | How to Solve and Generate Numberlink Puzzles Using SAT | Bergh van den, dr. M.J.H., Vliet van, dr. R. | Inf | |
| 2025‑2026 | Wisker, J. (Justin) | Finding the Best Balatro Start Decks Using a Tool that Calculates the ... | Bergh van den, dr. M.J.H., Graaf de, dr. J.M. | Inf | |
| 2024‑2025 | Waart, J. de (Jente) | Comparing Different Encodings for the Continuity Rule of the Logic Puz... | Hoogeboom, dr. H.J., Vliet van, dr. R., Bergh van den, dr. M.J.H. | Inf | |
| 2024‑2025 | Boer, N. (Noëlle) | An Analysis of CuBirds using Different Decision-Making Agents | Graaf de, dr. J.M., Bergh van den, dr. M.J.H. | Inf | |
| 2024‑2025 | Brown, M.C. (Mark) | Three-player Combinatorial Games | dr. T.C. Streng, Bergh van den, dr. M.J.H. | Inf | |
| 2024‑2025 | Ruigrok, M. (Max) | Generating and Solving Sigmar’s Garden Puzzles | Hoogeboom, dr. H.J., Bergh van den, dr. M.J.H. | Inf | |
| 2024‑2025 | Hassan, N. (Nour) | Monte Carlo Methods and Algorithms for the Card Game Hanamikoji | Bergh van den, dr. M.J.H. | Inf | |
| 2021‑2022 | Koschny, J. (Julius) | Synchronous Hackenbush | Kosters, dr. W.A., Bergh van den, dr. M.J.H. | CS | |
| 2021‑2022 | Lenstra, X. (Xander) | A Program for Analysing Combinatorial and Synchronized Games [IW] | Kosters, dr. W.A., Bergh van den, dr. M.J.H. | Inf | |
| 2020‑2021 | Jong, A. (Aron) de | An Analysis of the Cooperative Card Game The Crew [IW] | Kosters, dr. W.A., Bergh van den, dr. M.J.H. | Inf | |
| 2020‑2021 | Mol, T. (Thomas) de | Synchronized Cherries [IW] | Bergh van den, dr. M.J.H., Kosters, dr. W.A. | Inf | |
| 2018‑2019 | Varkevisser, F.E. (Florian) | Using Monte Carlo Tree Search to Play Cops & Robbers | Kosters, dr. W.A., Bergh van den, dr. M.J.H. | Inf | |
