Daniel Berend


  • Logic Games (joint with G. Weiss) The solution of logic games, such as Sudoku, often leads to interesting and well-known CS problems, usually NP-hard. We are interested in generating random instances of such puzzles and designing algorithms (including algorithms combining several strategies, as humans usually do) for their solution.
    Prerequisites: Interest in algorithms and knowledge of Java.