public static void main(String args[]){
        TilingProblem tp = new TilingProblem();
        Position p = new Position(5,6);
        char matrix[][] = tp.fit(8, p);
        for(int i=0; i < matrix.length; i++){
            for(int j=0; j < matrix[0].length ; j++){
                System.out.print(matrix[i][j] + " ");
            }
            System.out.println();
        }
    }
http://www.geeksforgeeks.org/divide-and-conquer-set-6-tiling-problem/
Test cases
Size of matrix is at least 2 and power of 2 always
Missing point could be on edges
Missing point could be in any of 4 quadrants
src/com/interview/multiarray/TilingProblem.java