no 5 adjacent stones
Source: China second round 2007 p2
March 10, 2012
combinatorics proposedcombinatorics
Problem Statement
In a chessboard, stones are placed in the squares. Now we have to remove some of the stones such that after the operation, there are no five adjacent stones horizontally, vertically or diagonally. Find the minimal number of stones that have to be removed.