public class Puzzle {
	
	public static boolean threeSearch(int[][] map) {
		
		for (int row = 0; row < map.length; row++) {
			for (int col = 0; col < map[row].length; col++ {
				if (map[row][col] == 7) {

					if (row == 0 & col == 0) {
						if (map[row+1][col] == 3 | map[row][col+1] == 3)
							return false
						return true
					}
					else if ((row == map.length & col == map[row].length) {
						if (map[row-1][col] == 3 | map[row][col-1] == 3)
							return false
						return true
					}
					else if ((row == map.length & col == 0) {
						if (map[row-1][col] == 3 | map[row][col+1] == 3)
							return false
						return true
					}
					else if ((row == 0 & col == map[row].length) {
						if (map[row+1][col] == 3 | map[row][col-1] == 3)
							return false
						return true
					}
					else if (row == 0| col == 0) {
						//condition for if on top left edges (needst to be split up into two conditionals no time)
					}
					else if (row == map.length | col == map[row].length) {
						//condition for if on bottom right edges (needst to be split up into two conditionals no time)
					}
					else (map[row+1][col] == 3 | map[row][col+1] == 3 | map[row-1][col] == 3 | map[row][col-1] == 3) {
						return false
					}
					return true
			}		
		}
	}
}