/Dennis Yurichev

Solving Martin Gardner's Chess Problem Using Simulated Annealing tl;dr: The problem is the maximum-attack problem, placing 8 pieces (not the pawns) on squares to attack the largest number of squares and, the converse, the minimum-attack problem using the simulated annealing algorithm.

featured in #249