MathNet 2025-part-01 — 187 problems (EN–VI) Question 148

How many ways can three distinct bishops be placed on an $8 \times 8$ chessboard such that no two of them attack each other?