Question

Needs to print coordinates of the paths.

In Computer Science, the Manhattan-Distance between two squares is determined by the minimal number of orthogonal King moves between the squares on the empty board. For example in Figure 1, the distance between the king and the queen is 9. Figure 1: Manhattan-Distance between two chess pieces Write a java program that gets the locations (vi, m) and (a,) of a king and another chess piece and determines all the paths from the king to the chess piece with the same Manhattan-Distance.

The program will find out the number of possible paths from the King to the piece. The program will print out each path from place to place.

Answer 1

Crn 왜 tRat minimum . Y manhatten distance go tee in Postion an d dilfevence in colu on d chen piece mnPostfion of ke kin e ing and chess can be asSomed to be in a soh chess hoo' d and we have to olve problem for tais Sob chesshond Stnce king ha to move ote ognay,So he Cn mouie king ouey hoi ontally n2e nokina bol Sdving e Problem rom at pastion thebond colum te a neo original hoteing burt oluing Re bvoblem from teat Po sitiene .neu, Sub chen bơand wie. You one

-HRe Sun o above two Sob PYo btemy give. Solo tion to IR:s prolem ora Sob chesshoqd ingle uox Column, on f "YouS ov, oneof . weonsidenen bott om posttional(0,0) Re and ttp right an(1.)) tHexe is e de scvee n shot for %, pron am proble

1 import java.io. 2 import java.util. 4 public class Chess 6 public static void main(String[] args) 8 9 10 Scanner s new Scanner(System.in); //variable for king's position int []k - new int[2]; //variable for other chess piece's position int []p new int[2]; 13 15 16 17 18 //take input from user System.out.print("Enter kings Positon:"); k[0].nextInt); k[1]S.nextInt); System.out.print("Enter chess piece Positon:"); p[]s.nextInt); p[1] s.nextInt); 20 21 //calculate the sub chess board's dimention int r Math.abs (k[e] -p[e]); int c-Math.abs(k[1]-p[1]): 24 25 26 27 28 29 30 //call function int paths -calculatePaths (r,c). System. out, println("No of paths are : "-paths) static int calculatePaths (int r, int c) //base condition 36 37 38 return 1; eise return calculatePaths (r-1,c) + calculatePaths (r,c-1); 40

C:\Users\Triple-Hash\Desktop HomeworkLibg javac Chess.java :\Users\Triple-Hash\Desktop\HomeworkLibg java Chess Enter kings Positon: e 4 Enter chess piece Positon : 5 No of paths are: 126 :\Users\Triple-Hash\Desktop\HomeworkLibg java Chess Enter kings Positon : e e Enter chess piece Positon: 7 7 No of paths are: 3432 :\Users\Triple-Hash\Desktop\HomeworkLibg java Chess Enter kings Positon: 2 2 Enter chess piece Positon : θ θ No of paths are: 6

3 oe Convenience impovt Java public da che Public salic void moin (tvingthom scann en S neto Scannen (stein vetiable foking Posi ion l viable for oleen che ss piece's PostHion ll take input ro se System oul print (Ce chem piece po sition:) l Calculae tRe Sob dens hoonds dimention

Call funclion lbeCondition else return Calculate 飞,c-;

Call funclion lbeCondition else return Calculate 飞,c-;