Guest

How many ways are there to place ( a) two bishops (b) two knights ( c ) two Queens on a chessboard so that they do not attract each other?

How many ways are there to place (a) two bishops (b) two knights (c) two Queens on a chessboard so that they do not attract each other?

Grade:

2 Answers

Arun
25758 Points
3 years ago
Dear student
 
I am getting my answer as 
(a) 1736
(B) 1848
(c) 1288
Please let me know if this is correct then I will share my solution.
 
Regards
Arun
vashitwa vishu
8 Points
3 years ago
Please provide your approach by which you are able to solve the problem please.

Think You Can Provide A Better Answer ?

Provide a better Answer & Earn Cool Goodies See our forum point policy

ASK QUESTION

Get your questions answered by the expert for free