13. The n-Rooks Problem is to place n rooks on an n × n chessboard so that these pieces are nonattacking. A rook can attack any piece on the same row or column. A solution to the 4–

rooks problem is shown in Figure 11.66.

Specify the architecture of a Discrete Hopfield Network to solve this problem.