Knight Moves
摘要:
Knight MovesDescriptionA 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 squares on a chessboard exactly once. He thinks that the most difficult part of the problem is det 阅读全文
posted @ 2012-05-15 20:15 即为将军 阅读(316) 评论(0) 推荐(0)
浙公网安备 33010602011771号