KöMaL 2006 K95
A one-digit number is written in each field of a 3×3 chessboard. A chessman is moved in an L-shaped path from one field to another (the way that a knight moves). Such an L consists of four fields. In how many different ways is it possible to fill out the 3×3 table with (not necessarily different) one-digit numbers so that the sum of the four numbers in every such L-shaped move is the same?
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.