private boolean checkConnections(Dijkstra dijkstra, List<Position> base,
			List<Position> goals) {
		for (Position diamondPos : base) {
			boolean foundWay = false;
			for (Position goalPos : goals) {
				List<Vertex> path = dijkstra.getPath(diamondPos, goalPos);
				// needs to be greater than 1
				if (path.size() > 1) {
					foundWay = true;
					break;
				}
			}

			/**
			 * if we have one element with no connections at all, we can return
			 * false
			 */
			if (foundWay == false) {
				return false;
			}
		}
		/**
		 * when we reach this point, we have found a connection for all
		 * positions
		 */
		return true;
	}