title: How to determine if a path is free of obstacles in chess?
body: <p>I have a 2D array containing all the Piece objects, each an instance of Rook, Bishop, King etc...</p>
  
  <p>How can I find out if the path from srcX,srcY to dstX,dstY is obstructed by another piece?</p>
  
  <p>The only things I can think of would involve massive amounts of tedious code =/</p>