public boolean DumbSolve(Point in, Point out){
		
		clearVars();
		
		lastChecked.add(in);
		
		int lock = 0;
		boolean running = true;
		while(running){
			toCheck.clear();
			for(Point p : lastChecked){
				for(Point q : getPointsAround(p)){
					doStuff(q);
				}
			}
			
			for(Point p : toCheck){
				pathSize[p.x][p.y] = 1;
				status = "now checking " + p.toString(); 
				if(p.x == out.x && p.y == out.y){
					running = false;
					status = "found!";
					return true;
				}
				
			}
			
			lastChecked = new HashSet<Point>(toCheck);
			lock++;
			if(lock > 9999){
				status = "not found";
				return false;
			}
		}
		return false;
	}