Rollback: N Bishops Problem

Question

This problem is driving me crazy ... Place N bishops aboard the NxN so that all squares are occupied or attacked by at least one of them.

Can someone help me with an algorithm to solve this problem?

Answer 1

Why come back? Use a small number of solutions to obtain evidence.

Even a greedy algorithm will be enough: count the number of squares available from each square. Select the square with the largest coverage that does not overlap with the previously selected coverage. Repeat.

Ambiguity generates horizontal, vertical, and lateral deviations.

N , . , . , , , . .

.

Answer 2

_ _ _ _ ♗ _ _ _ _
_ _ _ _ ♗ _ _ _ _
_ _ _ _ ♗ _ _ _ _
_ _ _ _ ♗ _ _ _ _
_ _ _ _ ♗ _ _ _ _
_ _ _ _ ♗ _ _ _ _
_ _ _ _ ♗ _ _ _ _
_ _ _ _ ♗ _ _ _ _
_ _ _ _ ♗ _ _ _ _

Answer 3

, .

BishopsProblem

, c.

Answer 4

, , - , .

, - - B_i * W_j, i + j = N. ( ), , , , , . , - . , , .

, - N.