title: Recursive puzzle
body: <p>I'm trying to run a recursive function for the next assignment:</p>
  
  <p>I have a Boolean board with nXn columns and rows.</p>
  
  <p>I want to search for a TRUE value on the diagonal lines (which are ↖ ↗ ↘ ↙) from a certain points specified by "row" and "col"</p>
  
  <p>When I find a TRUE value in the specific line - I'm adding it to a counter, and stop looking in the specific line.</p>
  
  <p>I want to return the number of TRUE values in the diagonal lines (minimun = 0 - maximun = 4)</p>
  
  <p>F  F  T  F</p>
  
  <p>F <strong>T</strong> F F</p>
  
  <p>F F F F</p>
  
  <p>F F F T</p>
  
  <p>for example, the search point is <strong>T</strong> {1,1}. I need to return back the number 2.</p>
  
  <pre><code>public static int Cross (boolean[][] board, int row, int col, int row2, int col2){ //function to check Cross Threat
      int countCross=0;
      if(row2&gt;=board.length | row2&lt;0 | col2&gt;=board.length | col2&lt;0) //out of bounds - 0
          countCross=0;
      else if(board[row2][col2] &amp; (row2!=row &amp; col2!=col)) 
          countCross=1;
      else
          countCross=Cross(board, row, col, row2+1, col2+1)+Cross(board, row, col, row2-1, col2-1)+Cross(board, row, col, row2+1, col2-1)+Cross(board, row, col,row2-1, col2+1);
      return countCross;
  }
  </code></pre>
  
  <p>The problem is that wheb i run this function, my Eclipse freezes.</p>
  
  <p>Thank you!</p>