KöMaL 2020 C1630
The numbers 1 to 32 are written in the white fields of a chessboard, using each number once. Then the sum of the numbers in the adjacent fields is entered in each black field. What are the smallest and largest possible values of the sum of the numbers in the black fields?
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.