private void findClosestDoor(final int target) {
		final int doorLoc = Math.max(boardBuffer-1, 0);
		final int doorLoc2 = boardSize + boardBuffer;
		int possibleDoors[][] = { 	{ board[boardCenter][doorLoc2], boardCenter, doorLoc2 }, 
									{ board[doorLoc][boardCenter],  doorLoc,  boardCenter }, 
									{ board[boardCenter][doorLoc],  boardCenter,  doorLoc }, 
									{ board[doorLoc2][boardCenter], doorLoc2, boardCenter } };

		for (int i=0; i<possibleDoors.length; i++) {
			if (possibleDoors[i][0] == target || (target==DOOR)&&(DOOROPEN==possibleDoors[i][0]) ) {
				if (target==UNKNOWN) { boardHasUnseen = true; }
				int x = possibleDoors[i][1];
				int y = possibleDoors[i][2];
				int absDistToX = Math.abs(x-meX), absDistToY = Math.abs(y-meY);
				int absDistToXY = absDistToX + absDistToY;
				if (absDistToXY < distToDest) {
					distToDest  = absDistToXY;
					distToDestX = absDistToX;
					distToDestY = absDistToY;
					destX       = x;
					destY       = y;
					if (DEBUG) { System.out.println("UNKNOWN || DOOR destX:"+destX+" destY:"+destY); }
				}
			}
		}
	}