Practical Course Implementation of Heuristic Algorithms for Board Games
Last offered: Summer 2026
- Degree
- Bachelor
- Lecturer
- Philipp Schroer
Contents
The project develops a computer player for an extended version of Reversi. Students incrementally improve their implementation using search algorithms, game-state evaluation, and measurements of efficiency. The work combines algorithm design with the engineering of a competitive game-playing program.
Topics include:
- Network socket programming
- Minimax and paranoid search
- Alpha-beta pruning, iterative deepening, and move ordering
- Aspiration windows and evaluation heuristics
- Performance and memory profiling
- Experimental analysis and technical reporting
Project Work
The practical course involves collaborative implementation and written reports. Source-code quality, playing strength, and the explanation of the implementation are central parts of the work. Implementation languages include Java and Rust.