Empty neighbours
0 views
Skip to first unread message
Susam Pal
Sep 13, 2011, 5:43:14 PM9/13/11
to cotpi
There are 64 pawns placed on a chessboard. Each square contains a
pawn. Two squares are neighbours of each other if they share a common
side.
In the first step, some pawns are removed. Then, at every step
thereafter, a pawn is removed from any square with at least two empty
neighbours. This continues until the board is empty or no more pawns
can be removed.
What is the minimum number of pawns that must be removed in the first
step so that all pawns can be removed in the subsequent steps?
Originally posted at: http://cotpi.com/p/21/
pawn. Two squares are neighbours of each other if they share a common
side.
In the first step, some pawns are removed. Then, at every step
thereafter, a pawn is removed from any square with at least two empty
neighbours. This continues until the board is empty or no more pawns
can be removed.
What is the minimum number of pawns that must be removed in the first
step so that all pawns can be removed in the subsequent steps?
Originally posted at: http://cotpi.com/p/21/
Reply all
Reply to author
Forward
0 new messages