MathDB

Symmetric non-self-intersecting path in 15*15 chessboard

Source: All-Russian Olympiad 2006 finals, problem 10.1 = 9.1

May 7, 2006

combinatorics proposedcombinatorics

Problem Statement

Given a

15\times 15

chessboard. We draw a closed broken line without self-intersections such that every edge of the broken line is a segment joining the centers of two adjacent cells of the chessboard. If this broken line is symmetric with respect to a diagonal of the chessboard, then show that the length of the broken line is

\leq 200

Back to Problems View on AoPS