public void findMoves(int n)
	{
		/* here n represents the size of the boat
		 * so now we populate the moves array that
		 * determines the combinations of missionaries
		 * and cannibals on the boat
		 */
		int i = 1;
		while(i < ((n+1)*(n+1)))
		{
			int first = i%(n+1);
			int second = i/(n+1);
			int result = (second*10)+first;
			if(first + second <= n)
				moves.add(result);
			i++;
		}
	}