Consider an n n chess-board, where n is an integer > 1. Suppose that coins are placed in different squares such that if a square s gets a coin then any other square sharing a side with s is empty. The maximum number of coins that can be placed on the board satisfying this condition is
Answers
Answered by
0
Answer:
If n is odd : (n+1)^2/4
If n is even : (n)^2/4
Pls mark Brainliest and Follow me for more answers.
Similar questions