Answers.Body: <p>Depending on whether occupied squares need to be covered as well, the number is:</p>
  
  <hr>
  
  <pre><code>[Title " 12 knights, Without Covering Occupied Squares"]
  [FEN "8/5N2/1NN1NN2/2N5/5N2/2NN1NN1/2N5/8 w - - 0 1"]
  </code></pre>
  
  <hr>
  
  <pre><code>[Title " 14 knights, With Covering Occupied Squares"]
  [FEN "8/2N1NN2/2N1N3/2N3N1/2N1N3/1NN1NNN1/8/8 w - - 0 1"]
  </code></pre>
  
  <hr>
  
  <p>Problems like this are called <em>domination problems</em> and solutions for knights and other pieces as well as a reference are given on the <a href="https://en.wikipedia.org/wiki/Mathematical_chess_problem#Domination_problems" rel="nofollow noreferrer">wikipedia page on mathematical chess problems</a></p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2018-12-17T00:02:41.810Z
Answers.LastActivityDate: 2019-06-17T17:37:09.627Z
Answers.LastEditDate: 2019-06-17T17:37:09.627Z
Answers.UserDisplayName: user1583209
Body: <p>I’ve seen the solutions to the lowest amount of queens, bishops, and rooks are needed to cover an entire board, as in they can attack all squares and are the only type of piece on the board. What is the solution for this with knights?</p>
  
Tags: <theory><problems><knights>
Title: What is the least number of knights needed to cover the entire board?
ThreadText: # What is the least number of knights needed to cover the entire board?
  
  (Asked by: username_0 on 2018-12-16)
  
  I’ve seen the solutions to the lowest amount of queens, bishops, and rooks are needed to cover an entire board, as in they can attack all squares and are the only type of piece on the board. What is the solution for this with knights?
  
  **Tags:** theory, problems, knights
  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_1 on 2018-12-17. Score: 25 | Accepted answer
  
  Depending on whether occupied squares need to be covered as well, the number is:
  
  [Title " 12 knights, Without Covering Occupied Squares"]
  [FEN "8/5N2/1NN1NN2/2N5/5N2/2NN1NN1/2N5/8 w - - 0 1"]
  
  
  [Title " 14 knights, With Covering Occupied Squares"]
  [FEN "8/2N1NN2/2N1N3/2N3N1/2N1N3/1NN1NNN1/8/8 w - - 0 1"]
  
  
  Problems like this are called domination problems and solutions for knights and other pieces as well as a reference are given on the wikipedia page on mathematical chess problems
  
  
  ---
  
  