Introduction - If you have any usage issues, please Google them yourself
Vault algorithm implementation: considering a location on the chess board of a horse, it may only be walking, just walk in addition to other locations outside the starting point each time, and finally be able to return to the initial point (Hamiltonian circuit )?