Each of the spots in a $8\times 8$ chessboard is occupied by either a black or white “horse”. At most how many black horses can be on the chessboard so that none of the horses attack more than one black horse?

[b]Remark:[/b] A black horse could attack another black horse.
1. **Understanding the Problem:**
   We need to place as many black horses as possible on an $8 \times 8$ chessboard such that no black horse can attack more than one other black horse. In chess, a horse (knight) moves in an "L" shape: two squares in one direction and then one square perpendicular, or one square in one direction and then two squares perpendicular.

2. **Initial Consideration:**
   Let's consider the maximum number of black horses that can be placed on the board. We need to ensure that each black horse can attack at most one other black horse. 

3. **Strategy:**
   We can use a pattern to place the black horses. One effective way is to place the black horses in a checkerboard pattern, but we need to ensure that no two black horses can attack more than one other black horse.

4. **Checkerboard Pattern:**
   Place black horses on every other square in a checkerboard pattern. This means placing black horses on all squares of one color (say, black squares) and white horses on the other color (white squares).

5. **Verification:**
   In a checkerboard pattern, each black horse is surrounded by white squares, and thus cannot attack another black horse. However, we need to ensure that no black horse can attack more than one other black horse.

6. **Detailed Placement:**
   Let's place black horses on the following positions:
   - (1,1), (1,3), (1,5), (1,7)
   - (3,1), (3,3), (3,5), (3,7)
   - (5,1), (5,3), (5,5), (5,7)
   - (7,1), (7,3), (7,5), (7,7)

   This gives us a total of 16 black horses.

7. **Checking the Condition:**
   Each black horse can attack at most one other black horse. For example, the black horse at (1,1) can attack the black horse at (3,2) and vice versa. Similarly, the black horse at (1,3) can attack the black horse at (3,4) and vice versa. This pattern ensures that no black horse can attack more than one other black horse.

8. **Proof of Maximum:**
   To prove that more than 16 black horses cannot be placed without violating the condition, consider any 4x4 subgrid. If we place more than 4 black horses in any 4x4 subgrid, at least one black horse will be able to attack more than one other black horse due to the density of placement.

   Therefore, the maximum number of black horses that can be placed on the chessboard such that no black horse can attack more than one other black horse is 16.

The final answer is $\boxed{16}$.