public ArrayList<Runner> turretsAttackRunners(int playerIndex, long time, ArrayList<Runner> runners)
	{	
		//List of runners to return that were died
		ArrayList<Runner> returnList = new ArrayList<Runner>();
		
		//Boolean to hold whether a given runner has died
		boolean died;
		//List<Runner> argument could be replaced by a KD-Tree which could be searched for 
		//nearest neighbor. This search here is being used until that happens
		
		//Run through every tower in the indicated player's list of towers
		for(int i=0;i<playerTowers.get(playerIndex).size();i++)
		{
			//Run through every runner
			for(int j=0;j<runners.size();j++)
			{
				//If the runner is within the range of the tower and the tower can shoot
				if(playerTowers.get(playerIndex).get(i).runnerIsWithinRange(runners.get(j)))
				{
					playerTowers.get(playerIndex).get(i).setTurretAngle(runners.get(j));
					if( playerTowers.get(playerIndex).get(i).canAttack(time))
					{
					//Attack the runner
						died = playerTowers.get(playerIndex).get(i).attackRunner(runners.get(j),time);
						//If the runner died, remove them from the list and add them to the return list
						if(died)
						{
							returnList.add(runners.remove(j));
						}
					}
				}
			}
		}
		
		return returnList;
	}