largest possible total length of the walls, on a mza of n^2 unit square cells
Source: ITAMO 1987 p7
February 2, 2020
combinatorics
Problem Statement
A square paper of side is divided into unit square cells. A maze is drawn on the paper with unit walls between some cells in such a way that one can reach every cell from every other cell not crossing any wall. Find, in terms of , the largest possible total length of the walls.