MathDB

2014 Combinatorics #8: Chessboard Diagonal Sum

Source:

February 23, 2014

Problem Statement

The integers

1, 2, \dots, 64

are written in the squares of a

8 \times 8

chess board, such that for each

1 \le i < 64

, the numbers

i

and

i+1

are in squares that share an edge. What is the largest possible sum that can appear along one of the diagonals?