java search question

* Discover all victims (reachable white pieces), given a the initial board * and a black knight placed at a particular start position. x A black knight may tour an 8 x 8 chess board according to the following rules: * 1. It may move from its current square to any of the eight nearby squares reachable by either: moving sideways two and vertically one; or vertically one and sideways two. Given the board below, a piece atmay move to any of the positions marked with an X". ok ok 2. It may not move to a square off the 8 x 8 board 3. It may not move to a square already occupied ok The number of 'victims' of the black knight is equal to all of the k white pieces that it could ever have reached on a tour according to the * above rules for touring the board. public class Q1Tourf enum Piece black, white h Piece[1 [1 pieces = new Piece [8] [8]; sok * Construct a new instance with a particular placement * @parplacement 01Tour(String placement) populateBoard(placement); k Take a placement string and populate the board * @param placement A string describing placement of black and white pieces private void populateBoard(String placement) f for(int i=0;