Question

Find the number of ways of choosing two squares which are not adjacent in a $8X8$ chess board

• A. $1904$ways
• B. $904$ways
• C. $1004$ways
• D. $2904$ways

Answer 1

The correct option is A $1904$ways

Number of squars $=64$

Numner of ways of selecting${=}^{64}{C}_2$ ways $=2016$ways

number of $7$ pairs of adjacent squares $=8\times 7=56$ways

number of $7$ pairs of adjacent squares $=8\times 7=56$ways

Favourable case $=112$

Required number$=2016-112=1904$ways