Given $2020\times 2020$ chessboard, what is the maximum number of warriors you can put on its cells such that no two warriors attack each other.

Warrior is a special chess piece which can move either $3$ steps forward and one step sideward and $2$ step forward and $2$ step sideward in any direction.

## BdMO National Higher Secondary 2019/10

- samiul_samin
**Posts:**1007**Joined:**Sat Dec 09, 2017 1:32 pm

- samiul_samin
**Posts:**1007**Joined:**Sat Dec 09, 2017 1:32 pm

### Re: BdMO National Higher Secondary 2019/10

Actual problem is more interestingly described.samiul_samin wrote: ↑Mon Mar 04, 2019 9:00 amGiven $2020\times 2020$ chessboard, what is the maximum number of warriors you can put on its cells such that no two warriors attack each other.

Warrior is a special chess piece which can move either $3$ steps forward and one step sideward and $2$ step forward and $2$ step sideward in any direction.

**BdMO National Higher Secondary 2019 P10**

In chess, a normal knight goes two steps forward and one step to the side, in some orientation. Thanic thought that he should spice the game up a bit, so he introduced a new kind of piece called a warrior. A warrior can either go three steps forward and one step to the side, or two steps forward and two steps to the side in some orientation.

In a $2020\times 2020$ chessboard, prove that the maximum number of warriors so that none of them attack each other is less than or equal to $\dfrac 25$ of the number of cells.

- samiul_samin
**Posts:**1007**Joined:**Sat Dec 09, 2017 1:32 pm

### Re: BdMO National Higher Secondary 2019/10

Given Diagram:

If we put the warriors at $4k+1$ row,we will get the number of total knights as the question but how can we prove that this the the lowest number of warriors?