Write the following code in java, replit:   A bishop in chess can move as far as it likes in a diagonal line on a chess board, so long as no other piece of its same color blocks its path. If a piece of a different color blocks its path it can only move as far as that piece, taking it, and ending its turn. For this, you are given the following classes, Board, Bishop, and Piece. You will write code that determines if a particular move for a bishop is valid. Note that chess is a game of many pieces, all bishops are pieces, all pieces have a symbol and location, not all pieces are bishops. PART A Give the Main class as writen above, Make the code compile such that the piece and the bishop have the same relationship in code that is described in the general description. PART B Use a Scanner to allow a person to enter coordinates to a chess board (0-7 for x and 0 - 7 for y) that represent the final destination for the bishop. Write the method that will determine of that move is valid for that bishop independant of other pieces on the board. PART C Consider the Board class. The two pieces share the same Board object. Write a method for the Board class that can draw itself. HINT: Use an ArrayList to track your pieces. PART D Create a Rook class and add an instance of it to the board in the Main class. Make your program correctly determine if you Rook can take your Bishop.

EBK JAVA PROGRAMMING
9th Edition
ISBN:9781337671385
Author:FARRELL
Publisher:FARRELL
Chapter4: More Object Concepts
Section: Chapter Questions
Problem 1GZ
icon
Related questions
Question

Write the following code in java, replit:

 

A bishop in chess can move as far as it likes in a diagonal line on a chess board, so long as no other piece of its same color blocks its path. If a piece of a different color blocks its path it can only move as far as that piece, taking it, and ending its turn.

For this, you are given the following classes, Board, Bishop, and Piece. You will write code that determines if a particular move for a bishop is valid.

Note that chess is a game of many pieces, all bishops are pieces, all pieces have a symbol and location, not all pieces are bishops.

PART A

Give the Main class as writen above, Make the code compile such that the piece and the bishop have the same relationship in code that is described in the general description.

PART B

Use a Scanner to allow a person to enter coordinates to a chess board (0-7 for x and 0 - 7 for y) that represent the final destination for the bishop. Write the method that will determine of that move is valid for that bishop independant of other pieces on the board.

PART C

Consider the Board class. The two pieces share the same Board object. Write a method for the Board class that can draw itself. HINT: Use an ArrayList to track your pieces.

PART D

Create a Rook class and add an instance of it to the board in the Main class. Make your program correctly determine if you Rook can take your Bishop.

Expert Solution
steps

Step by step

Solved in 4 steps with 5 images

Blurred answer
Knowledge Booster
Adjacency Matrix
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
Microsoft Visual C#
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,