Introduction - If you have any usage issues, please Google them yourself
to solve the best case number of which how many times the king located at some position(x1,y1) to move to kill the the other ones located some position(x2,y2) in the chessBoard.
implemented by BFS