Ratinmaze backtracking

#1

getting segmentation fault.

#2

to remove segmentation fault
change base case
if(i==m-1 && j==n-1){
it should be double equal to

Modified Code

but this code print all possible paths
and in question you have to print only rightmost path

to print only one solution also add one condition
if(rightjao) return true;
after right call

check the code

#3

but i>=m also means same na?

#4

at which line??
tell the line no in modified Code

#5

line number 18 in code

#6

same to what??

// invalid cases.
	if(i>=m || j>=n){
		return false;
	}

this is correct

#7

so what was the mistake earlier ?

#8

as i mention
it was at base case
there must be double equal to
you have make single equal to

= this is for assingment
== this is for comparision

#9

well its printing only one solution not all

#10

this is because i have added that line

please first read my reply completely

#11

ohh ya got it suppose in question if they asked for down then as we got solutn from down then return true na?

#12

yes

if you have more doubts regarding this feel free to ask
i hope this helps
if yes hit a like and don’t forgot to mark doubt as resolved :grinning:

#13

what if rat can move in all 4direction?

#14

yes it can also happens

there is one more question in which all 4 moves are allowed
you can try this problem

#15

not gettin that