public int checkSidwaysDown(int originLetter, int originNum, int newLetter, int newNum, Board b)
	{
		valid = 0;
		int diagnalDownLetter = originLetter;
		int diagnalDownNumber = originNum;
		if(newLetter > originLetter)
		{
			int downRightValid = 0;
			for(int counter = 0; counter < ((newNum-originNum)-1); counter++)
			{
				diagnalDownLetter = diagnalDownLetter + 1;
				diagnalDownNumber = diagnalDownNumber + 1;
				if(b.checkBoard(diagnalDownLetter,diagnalDownNumber).matches(chessPieces))
				{
					System.out.println(error);
				}
				else
				{
					downRightValid = 1;
				}
				valid = downRightValid;
			}
			
		}
		else if(originLetter > newLetter)
		{
			int downLeftValid = 0;
			for(int counter = 0; counter < ((newNum-originNum)-1); counter++)
			{
				diagnalDownLetter = diagnalDownLetter - 1;
				diagnalDownNumber = diagnalDownNumber + 1;
				if(b.checkBoard(diagnalDownLetter,diagnalDownNumber).matches(chessPieces))
				{
					System.out.println(error);
				}
				else
				{
					downLeftValid = 1;
				}
				valid = downLeftValid;
			}
			
		}
		return valid;
	}