public int getNextLevel()
	{
		int level = 0;
		boolean unsolved = false;
		//all the levels have been solved, then get the first unsolved level
		for (int i = 0; i < solved.length; i++)
		{
			if(solved[i] == 0 )
			{
					unsolved = true;
					level = (byte)(i + 1);
					if(level <= currentLevel && currentLevel < solved.length)
						continue;
					else
						return level;
			}
		}
		if(unsolved)
			return level;
	    level = (byte)((this.currentLevel + 1)%solved.length);
		if(level == 0)
			level = solved.length;
		return level; 
	}