HDOJ/HDU 1372 Knight Moves(經典BFS)

Problem Description A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n s

>>阅读原文<<