title: Defective chessboard problem - looking for pseudocode algorithm (divide&conquer)
body: <p>I should use the divide-and-conquer paradigm to design a recursive algorithm "CBCover", which determines a coverage (as seen in the image below) in runtime O(n^2) (n = 2^k).</p>
  
  <p>The entry/ input of CBCover should be (k, a, b), where k defines the size of the chessboard, and (a, b) are the coordinates of the missing field. </p>
  
  <p>Possible coverage:</p>
  
  <p><img src="https://i.stack.imgur.com/5kgiG.png" alt="Possible coverage"></p>
  
  <p>4x4 chessboard missing (4, 1):</p>
  
  <p><img src="https://i.stack.imgur.com/H1Ks7.png" alt="Chessboard with size 2^2 X 2^2 and missing field (4,1)"></p>
  
  <p>Does anyone have any idea what the <strong>pseudocode</strong> could look like?</p>