private void checkAdjacentNodesStart(Node origin) {
		Node n = null;
		for (int i = origin.x-1; i <= origin.x+1; i++) {
			for (int j = origin.y-1; j <= origin.y+1; j++) {
				if (!(i == origin.x && j == origin.y)) {
					n = new Node(i, j);
					int dirr = directionFromAdjacentNode(origin, n);
					if (dirr == 1) {
						if (isValidStart(n)) {
							n.parent = origin;
							calculateG(n);
							calculateH(n);
							calculateF(n);
							addToOpenList(n);
						}
					}
				}
			}
		}
	}