Consider a chessboard with dimensions n×n, where n is an odd integer greater than 1. If you place a rook on any square of the chessboard, how many squares can it attack (i.e., threaten to move to) without moving from its initial position?

Answer 1

when you place a rook on any square of an

�

×

�

n×n chessboard, it can attack

2

�

−

1

2n−1 squares without moving from its initial position. This includes attacking all squares in its row and column except for its own square, which is counted once.