solves the N-Queen problem by moving forward column by column if safe and moving backward if not @param board 2D board char array @param N size of board @param col current column working on @return true if find a location to place Q at col; false if not or done with placing all N Q's
(char[][] board, int N, int col)