Our King must never be Attacked!

Computer Science Level 3

In a basic game of chess, if there's only two pieces left: a king and a rook. How many ways can a king be safe from the opponent's rook if they are placed in all possible combination?

Details and Assumptions:

  • Assume there is no opponent's king.

  • This is a Computer Science problem.


Problem Loading...

Note Loading...

Set Loading...