@@ -71,6 +71,7 @@ Please think about a project you want to do and talk with us about your ideas.
Here is a list of potential problems:
* Puzzle: Given a polyomino, place a minimal number of knights such that every field in the polyomino is covered. You can also state a random set of figures and quantities and ask for a full covering placement.
* Game: Consider a simple turn-based single-player game where the player has a finite set of selectable actions in each turn, and has some goal, such as collecting a resource. You can write a solver which comes up with the optimal strategy (list of actions) for a given initial state (board layout, inventory, coins, resources, etc.) that maximizes an objective. You can of course come up with your own game, or take inspiration from existing games/puzzles.
* Vehicle Routing: There is an abundant amount of touring problems you could write a solver for. E.g., picking up food from various restaurants with a set of drones and delivering it to customers as quickly as possible.
* Scheduling and Assignment: There are also many scheduling variants you could optimize. E.g., schedule the time table for some competition such that the breaks for the participants between matches are maximized.
* Write an applet that lets you learn how Branch and Bound works (e.g., for the Knapsack-problem you learned about in AuD2).
