private boolean checkNestPositions(int size, int[] redPos, int[] blackPos) {
		if(!(redPos[1]+(size*2)>blackPos[1] && redPos[1]-(size*2)<blackPos[1])) {
			return true;
		} else {
			if(redPos[0]==blackPos[0]) {
				return false;
			} else {	
				int[] leftNest;
				int[] rightNest;
				if(redPos[0]>blackPos[0]) {
					leftNest = blackPos;
					rightNest = redPos;
				} else {
					leftNest = redPos;
					rightNest = blackPos;
				}
				if(leftNest[0]+(size*2)-1<rightNest[0]) {
					return true;
				} else {
					if(leftNest[0]+(size*2)-1-(Math.abs(leftNest[1]-rightNest[1])-leftNest[1]%2+1)/2<rightNest[0]) {
						return true;
					} else {
						return false;
					}
				}
			}
		}
	}