Help With class assignment - recursion

[Ivanniki]

Hey,

got this class assignment to recursively move through an array of numbers
and return true or false whether is possible to reach the zero

you start at leftmost part of the array and the goal is to get to the 0 in the rightmost part
each step is determined by the int on the current array[step]
3 is the first step which means you move to 1 because its 3 columns away,
you can move either right or left (if allowed to reach the goal)

{3, 6, 4, 1, 3, 4, 2, 5, 3, 0}

unsolvable example
{3, 1, 2, 3, 0}
Here, one can bounce between the two 3’s, but cannot reach any other square.
here is my try at the solution but it doesn't work for all the different arrays

public class GetToTheZero {
	public static boolean [] first,second;
	public static boolean isSolvable(int start, int[] board)
	{
		first=new boolean[board.length];
		boolean solution=check (start, board);
		return solution; 

	}
	
	public static boolean check (int start, int[] board)
	{

		if(board[start]==0)
			return true;
		if(valid(start))
		{
		if(start+board[start]<board.length-1)
			if(isSolvable(start+board[start],board))
				return true;
		if(start-board[start]>0)
			if(isSolvable(start-board[start],board))
				return true;
		}
		return false;
	}
	public static boolean valid(int start)
	{
		if(first[start]==false)
		{
			first[start]=true;
			return true;
		}
		
		
		return false; 
	}
}

Thanks for the help

[JosAH]

Hey,

got this class assignment to recursively move through an array of numbers
and return true or false whether is possible to reach the zero

you start at leftmost part of the array and the goal is to get to the 0 in the rightmost part
each step is determined by the int on the current array[step]
3 is the first step which means you move to 1 because its 3 columns away,
you can move either right or left (if allowed to reach the goal)

{3, 6, 4, 1, 3, 4, 2, 5, 3, 0}

unsolvable example
{3, 1, 2, 3, 0}
Here, one can bounce between the two 3’s, but cannot reach any other square.
here is my try at the solution but it doesn't work for all the different arrays

public class GetToTheZero {
	public static boolean [] first,second;
	public static boolean isSolvable(int start, int[] board)
	{
		first=new boolean[board.length];
		boolean solution=check (start, board);
		return solution; 

	}
	
	public static boolean check (int start, int[] board)
	{

		if(board[start]==0)
			return true;
		if(valid(start))
		{
		if(start+board[start]<board.length-1)
			if(isSolvable(start+board[start],board))
				return true;
		if(start-board[start]>0)
			if(isSolvable(start-board[start],board))
				return true;
		}
		return false;
	}
	public static boolean valid(int start)
	{
		if(first[start]==false)
		{
			first[start]=true;
			return true;
		}
		
		
		return false; 
	}
}

Thanks for the help

That should be:

		if(start+board[start]<board.length)
			if(isSolvable(start+board[start],board))
				return true;
		if(start-board[start]>=0)
			if(isSolvable(start-board[start],board))
				return true;
		}

Arrays start at index value 0 and the highest index value is n-1 where n is the length of the array.

kind regards,

Jos