Problem

Source:

Tags: combinatorics



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? Remark: A black horse could attack another black horse.