Question 5. (15 marks)

You are given a n x n-chess board, on which two bishops | one

white and one black | are placed on two dierent white squares. (The

bishop chess piece only moves diagonally for any number of squares.)

You take turns alternating between moving the white bishop and

the black bishop. You cannot move a bishop to a square where it

might be captured by the opposite-color piece. So, for example, in the

situation detailed in Figure 1 you can move the black bishop to any square along the blue arrows except for the two squares marked by

a red-X, as in those two red squares it can be captured by the white

bishop.

Design an algorithm that takes as an input the starting positions

of the two black and white bishops and the end positions, and nds

a shortest sequence of moves that takes the bishops to their end-

positions. What is the runtime of your algorithm?

 

 

Question 5. (15 marks) You are given a n X n—chess board, on which two bishops 7 one
white and one black 7 are placed on two different white squares. (The
bishop chess piece only moves diagonally for any number of squares.) You take turns alternating between moving the white bishop and
the black bishop. You cannot move a bishop to a square where it
might be captured by the opposite—color piece. So, for example, in the
situation detailed in Figure 1 you can move the black bishop to any

• 1493177667-QQ20170409142707.png
• 1493177668-QQ20170409142702.png

ComputerScienceExpert

(11)

Status NEW Posted 26 Apr 2017 03:04 AM My Price 9.00

-----------

Attachments

file 1493177670-Solutions file 2.docx preview (51 words )

H-----------ell-----------o S-----------ir/-----------Mad-----------am ----------- Th-----------ank----------- yo-----------u f-----------or -----------you-----------r i-----------nte-----------res-----------t a-----------nd -----------buy-----------ing----------- my----------- po-----------ste-----------d s-----------olu-----------tio-----------n. -----------Ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be----------- qu-----------ick-----------ly -----------onl-----------ine----------- an-----------d g-----------ive----------- yo-----------u e-----------xac-----------t f-----------ile----------- an-----------d t-----------he -----------sam-----------e f-----------ile----------- is----------- al-----------so -----------sen-----------t t-----------o y-----------our----------- em-----------ail----------- th-----------at -----------is -----------reg-----------ist-----------ere-----------d o-----------n -----------THI-----------S W-----------EBS-----------ITE-----------. ----------- Th-----------ank----------- yo-----------u -----------

Not Rated(0)

• Buy Answer