A field has a shape of checkboard 41x41 square. A tank concealed in one of the cells of the field. By one shot, a fighter airplane fires one of the cells. If a shot hits the tank, then the tank moves to a neighboring cell of the field, otherwise it stays in its cell (the cells are neighbours if they share a side). A pilot has no information about the tank , one needs to hit it twice. Find the least number of shots sufficient to destroy the tank for sure. (S.Berlov,A.Magazinov) combinatorics unsolvedcombinatorics