Introduction - If you have any usage issues, please Google them yourself
Checkerboard algorithm, given the size of the square-shaped board, will be a pawn of " horses" on the specified start position, the pieces of " horses" take the child must be the rules of the board to the " day" word from a pawn " horses, " starting position of the beginning, search out a feasible path, makes the piece" Horse " can be traveled on board all the Lazi, and they can only go once every Lazi point