Ole Pöschl

• The N-queens problem is a challenging combinatorial problem where N queens are placed on an N times N chessboard such that no two attack each other. While seemingly simple, the number of solutions grows exponentially with increasing N. This thesis proposes a distributed solver that leverages an arbitrary number of heterogeneous GPUs across computers to tackle this problem for larger boards.