title: Backtracking: N Bishops Problem
body: <p>This problem is driving me crazy... Place N bishops on NxN board in a way, where all squares would be occupied or attacked with at least one of them.</p>
  
  <p>Could anyone help me out with an algorithm for solving this problem?</p>