You are viewing a single comment's thread. Return to all comments →
Consider this:
10 .X..XX...X X......... .X.......X .......... ........X. .....X..XX .....X.X.. .......... .....X..XX 9 1 9 6
From (9,1) to (9,6) there are two paths:
1st: (9,1) -> (9,2) -> (9,3) -> (9,4) -> (8,4) -> (8,5) -> (8,6) -> (9,6) No. of Steps = 8 No. of turns = 4 2nd: (9,1) -> (8,1) -> (8,2) -> (8,3) -> (8,4) -> (8,5) -> (8,6) -> (9,6) No. of Steps = 8 No. of turns = 3
How will distance be helpful for me to find the least number of turns?
Seems like cookies are disabled on this browser, please enable them to open this website
Castle on the Grid
You are viewing a single comment's thread. Return to all comments →
Consider this:
From (9,1) to (9,6) there are two paths:
How will distance be helpful for me to find the least number of turns?